A New Exact Solution Algorithm for the Job Shop Problem with Sequence-Dependent Setup Times

Christian Artigues (1) , Sana Belmokhtar (2, 3) , Dominique Feillet (1)

1 LAAS - Laboratoire d'analyse et d'architecture des systèmes
2 MSGI-ENSMSE - Département Méthodes Scientifiques pour la Gestion Industrielle
3 ROGI-ENSMSE - Equipe : Recherche Opérationnelle pour le Génie Industriel

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.

Domains: Modeling and Simulation

Christian Artigues, Sana Belmokhtar, Dominique Feillet. A New Exact Solution Algorithm for the Job Shop Problem with Sequence-Dependent Setup Times. Régin, Jean-Charles; Rueher, Michel. Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Springer Berlin / Heidelberg, pp. 37-49, 2004, Lecture Notes in Computer Science, 978-3-540-21836-4. ⟨10.1007/978-3-540-24664-0_3⟩. ⟨emse-00712628⟩