Abstract
We propose a new solution approach for the Job Shop Problem with Sequence Dependent Setup Times (SDST-JSP). The problem consists in scheduling jobs, each job being a set of elementary operations to be processed on different machines. The objective pursued is to minimize the completion time of the set of operations. We investigate a relaxation of the problem related to the traveling salesman problem with time windows (TSPTW). Our approach is based on a Branch and Bound procedure, including constraint propagation and using this relaxation. It compares favorably over the best available approaches from the literature on a set of benchmark instances.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Adams, J., Balas, E., Zawack, D.: The Shifting Bottleneck Procedure for Job-Shop Scheduling. Manag. Sci. 34, 391–401 (1988)
Artigues, C., Lopez, P., Ayache, P.D.: Schedule generation schemes and priority rules for the job-shop problem with sequence dependent setup times: Dominance properties and computational analysis. To appear in Annals of Operations Research (2003)
Artigues, C., Buscaylet, F.: A fast tabu search method for the job-shop problem with sequence-dependent setup times. In: Proceedings of the Metaheuristic International Conference MIC 2003, Kyoto (2003)
Baptiste, P., Le Pape, C., Nuijten, W.: Constrained-Based scheduling. In: Applying constraint programming to Scheduling Problems. Kluwer’s International Series, pp. 19–37 (2001)
Blazewicz, J., Domschke, W., Pesch, E.: The job shop scheduling problem: Conventional and new solution techniques. European Journal of Operational Research 93(1), 1–33 (1996)
Brucker, P., Thiele, O.: A branch and bound method for the general-shop problem with sequence-dependent setup times. Operations Research Spektrum 18, 145–161 (1996)
Carlier, J., Pinson, E.: An algorithm for solving the Job-Shop Problem. Management Science 35, 164–176 (1989)
Choi, I.-N., Choi, D.-S.: A local search algorithm for jobshop scheduling problems with alternative operations ans sequence-dependent setups. Computers and Industrial Engineering 42, 43–58 (2002)
Focacci, F., Laborie, P., Nuijten, W.: Solving scheduling problems with setup times and alternative resources. In: Fifth International Conference on Artificial Intelligence Planning and Scheduling, Breckenbridge, Colorado, pp. 92–101 (2000)
Focacci, F., Lodi, A.: Solving TSP with Time Windows with Constraints. In: International Conference on Logic Programming, pp. 515–529 (1999)
ILOG SOLVER 5.2 User’s Manuel, ILOG (2000)
ILOG SCHEDULER 5.2 User’s Manuel, ILOG (2000)
Nowicki, E., Smutnicki, C.: A fast taboo search algorithm for the job shop problem. Management Science 42, 797–813 (1996)
Pesant, G., Gendreau, M., Potvin, J.-Y., Rousseau, J.-M.: An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows. European Journal of Operational Research 117, 253–263 (1999)
Vaessens, R.J.M., Aarts, E.H.L., Lenstra, J.K.: Job Shop Scheduling by Local Search. INFORMS Journal on Computing 8, 302–317 (1996)
Vilím, P., Barták, R.: Filtering Algorithms for Batch Processing with Sequence Dependent Setup Times. In: Ghallab, Hertzberg, Traverso (eds.) Proceedings of The Sixth International Conference on Artificial Intelligence Planning and Scheduling (AIPS 2002), pp. 312–320. AAAI Press, Toulouse (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Artigues, C., Belmokhtar, S., Feillet, D. (2004). A New Exact Solution Algorithm for the Job Shop Problem with Sequence-Dependent Setup Times. In: Régin, JC., Rueher, M. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2004. Lecture Notes in Computer Science, vol 3011. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24664-0_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-24664-0_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21836-4
Online ISBN: 978-3-540-24664-0
eBook Packages: Springer Book Archive