Job shop scheduling with setup times, deadlines and precedence constraints

Authors:
Egon Balas;Neil Simonetti;Alkis Vazacopoulos
Affiliations:
Carnegie Mellon University, Pittsburgh, USA;Bryn Athyn College of the New Church, Bryn Athyn, USA;Dash Optimization, Englewood Cliffs, USA
Venue:
Journal of Scheduling
Year:
2008

Citing 4
Cited 11

The shifting bottleneck procedure for job shop scheduling

Management Science
The one-machine problem with delayed precedence constraints and its use in job shop scheduling

Management Science
Guided Local Search with Shifting Bottleneck for Job Shop Scheduling

Management Science
Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study

INFORMS Journal on Computing

Research on job shop scheduling under uncertainty

Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
Genetic Algorithm Combined with Tabu Search for the Job Shop Scheduling Problem with Setup Times

IWINAC '09 Proceedings of the 3rd International Work-Conference on The Interplay Between Natural and Artificial Computation: Part I: Methods and Models in Artificial and Natural Computation. A Homage to Professor Mira's Scientific Legacy
A Tabu search algorithm to minimize lateness in scheduling problems with setup times

CAEPIA'09 Proceedings of the Current topics in artificial intelligence, and 13th conference on Spanish association for artificial intelligence
Integrated Sequencing and Scheduling in Coil Coating

Management Science
Applying a hybrid job shop procedure to a Belgian manufacturing company producing industrial wheels and castors in rubber

Computers and Industrial Engineering
Solving job shop scheduling with setup times through constraint-based iterative sampling: an experimental analysis

Annals of Mathematics and Artificial Intelligence
A competent memetic algorithm for complex scheduling

Natural Computing: an international journal
Tabu search and lower bound for an industrial complex shop scheduling problem

Computers and Industrial Engineering
Job shop scheduling with setup times and maximal time-lags: a simple constraint programming approach

CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Analytical Modeling for the Strategic Design of Service Systems

International Journal of Strategic Information Technology and Applications
Lateness minimization with Tabu search for job shop scheduling problem with sequence dependent setup times

Journal of Intelligent Manufacturing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the last 15 years several procedures have been developed that can find solutions of acceptable quality in reasonable computing time to Job Shop Scheduling problems in environments that do not involve sequence-dependent setup times of the machines. The presence of the latter, however, changes the picture dramatically. In this paper we adapt one of the best known heuristics, the Shifting Bottleneck Procedure, to the case when sequence dependent setup times play an important role. This is done by treating the single machine scheduling problems that arise in the process as Traveling Salesman Problems with time windows, and solving the latter by an efficient dynamic programming algorithm. The model treated here also incorporates precedence constraints, release times and deadlines. Computational experience on a vast array of instances, mainly from the semiconductor industry, shows our procedure to advance substantially the state of the art.