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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Adams, J., Balas, E., & Zawack, D. (1988). The shifting bottleneck procedure for job-shop scheduling. Management Science, 34, 391–401.
Artigues, C., & Feillet, D. (2006, forthcoming). A branch and bound method for the job-shop problem with sequence-dependent setup times. Annals of Operations Research.
Balas, E. (1999). New classes of efficiently solvable generalized traveling salesman problems. Annals of Operations Research, 84, 529–558.
Balas, E., & Simonetti, N. (2001). Linear time dynamic programming algorithms for new classes of restricted TSPs. INFORMS Journal on Computing, 13, 56–75.
Balas, E., & Vazacopoulos, A. (1998). Guided local search with shifting bottleneck for job shop scheduling. Management Science, 44, 262–275.
Balas, E., Lenstra, J. K., & Vazacopoulos, A. (1995). The one-machine problem with delayed precedence constraints and its use in job shop scheduling. Management Science, 41, 94–109.
Balas, E., Lancia, G., Serafini, P., & Vazacopoulos, A. (1998). Job shop scheduling with deadlines. Journal of Combinatorial Optimization, 1, 329–353.
Brucker, P., & Thiele, O. (1996). A branch and bound method for the general-shop scheduling problem with sequence dependent setup times. Operations Research Spektrum, 18, 145–161.
Buscaylet, F., & Artigues, C. (2003). A fast tabu search method for the job-shop problem with sequence-dependent setup times. In MIC 2003, the fifth metaheuristics international conference, Kyoto, Japan.
Carlier, J. (1982). The one-machine sequencing problem. European Journal of Operational Research, 11, 42–47.
Focacci, F., Laborie, P., & Nuijten, W. (2000). Solving scheduling problems with setup times and alternative resources. In Fifth international conference on artificial intelligence planning and scheduling (pp. 92–101), Breckenbridge, CO.
Held, M., & Karp, R. M. (1962). A dynamic programming approach to sequencing problems. SIAM Journal of Applied Mathematics, 10, 196–210.
Ovacik, I., & Uzsoy, R. (1994). Exploiting shop floor status information to schedule complex job shops. Journal of Manufacturing Systems, 13(2), 73–84.
Ovacik, I., & Uzsoy, R. (1997). Decomposition methods for complex factory scheduling problems. Dordrecht: Kluwer Academic.
Author information
Authors and Affiliations
Corresponding author
Additional information
Paper presented in New York at MISTA 2005.
E. Balas supported by the National Science Foundation through grant DMI-9802773 and by the Office of Naval Research through contract #N00014-97-1-0133.
Rights and permissions
About this article
Cite this article
Balas, E., Simonetti, N. & Vazacopoulos, A. Job shop scheduling with setup times, deadlines and precedence constraints. J Sched 11, 253–262 (2008). https://doi.org/10.1007/s10951-008-0067-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10951-008-0067-7