Journal Article10.1080/09537280110069757
An efficient algorithm for operation insertion in a multi-resource job-shop schedule with sequence-dependent setup times
Christian Artigues,Ois Roubellat +1 more
28
TL;DR: A new polynomial insertion algorithm of an operation inside a multi-resource job-shop schedule with sequence-dependent setup times with maximum lateness minimization is presented.
read more
Abstract: Insertion of an operation inside an existing schedule is the central part of some neighbourhood search methods for off-line job-shop scheduling. It is also a basic tool to integrate unexpected jobs during on-line scheduling. In this paper is presented a new polynomial insertion algorithm of an operation inside a multi-resource job-shop schedule with sequence-dependent setup times. The considered objective is maximum lateness minimization. The algorithm is first described for the classical job-shop scheduling problem. Then, multi-resource requirements are introduced for the operations. Last, sequence-dependent setup times are considered in the multi-resource context. It is shown in the three cases that some dominance properties make the proposed insertion algorithm superior to the enumeration algorithms that can be used alternatively.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A survey of scheduling problems with setup times or costs
TL;DR: An extensive review of the scheduling literature on models with setup times (costs) from then to date covering more than 300 papers is provided, which classifies scheduling problems into those with batching and non-batching considerations, and with sequence-independent and sequence-dependent setup times.
1.4K
Insertion techniques for static and dynamic resource-constrained project scheduling
TL;DR: A flow network model, based on a new polynomial insertion algorithm taking advantage on the flow structure, is proposed for static and dynamic scheduling methods for static resource-constrained project scheduling problem.
326
Scheduling and lot sizing with sequence-dependent setup: A literature review
Xiaoyan Zhu,Wilbert E. Wilhelm +1 more
TL;DR: A review of the literature related to the class of scheduling problems that involve sequence-dependent setup times (costs), an important consideration in many practical applications, can be found in this paper.
252
Schedule Generation Schemes for the Job-Shop Problem with Sequence-Dependent Setup Times: Dominance Properties and Computational Analysis
TL;DR: In this article, the authors consider the job shop problem with sequence-dependent setup times and propose schedule generation schemes (SGSs) based on the semi-active, active, and non-delay schedule categories.
•Posted Content
Schedule generation schemes for the job-shop problem with sequence-dependent setup times: dominance properties and computational analysis
TL;DR: The proposed S GSs significantly improve previously best-known results on a set of hard benchmark instances and show how the proposed SGSs can be used within single-pass and multi-pass priority rule based heuristics.
62
References
Multi-resource shop scheduling with resource flexibility
TL;DR: A disjunctive graph representation of this problem is presented and a connected neighborhood structure is proposed that can be used to derive a local search algorithm such as tabu search.
132
A branch & bound method for the general-shop problem with sequence dependent setup-times
Peter Brucker,Olaf Thiele +1 more
TL;DR: In this paper, a branch and bound algorithm is presented for a very general scheduling problem withn jobs andm machines, where each job consists of a set of operations and each operation has to be processed on a dedicated machine.
114
Exploiting shop floor status information to schedule complex job shops
Irfan M. Ovacik,Reha Uzsoy +1 more
TL;DR: In this article, a heuristic for scheduling complex job shops that uses the shop floor status information available in many of today's computerized systems to make dispatching decisions is proposed.
89
n jobs and m machines job-shop problems with sequence-dependent set-up times
TL;DR: A mathematical model based on the branch-and-bound technique to solve static scheduling problems involving n jobs and m machines where the objective is to minimize the cost of setting up the machines is presented.
58
On the application of insertion techniques for job shop problems with setup times
TL;DR: Dans notre publication nous considerons differents problemes de « job shop scheduling » avec des temps de preparation avec d'autres algorithmes de priorite, plus precisement Item- and Batch-disponibilite.