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

  • Christian Artigues
  • Sana Belmokhtar
  • Dominique Feillet
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3011)


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.


Setup Time Search Tree Constraint Programming Precedence Constraint Sequence Dependent Setup Time 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Adams, J., Balas, E., Zawack, D.: The Shifting Bottleneck Procedure for Job-Shop Scheduling. Manag. Sci. 34, 391–401 (1988)CrossRefMathSciNetzbMATHGoogle Scholar
  2. 2.
    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)Google Scholar
  3. 3.
    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)Google Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    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)CrossRefzbMATHGoogle Scholar
  6. 6.
    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)CrossRefMathSciNetzbMATHGoogle Scholar
  7. 7.
    Carlier, J., Pinson, E.: An algorithm for solving the Job-Shop Problem. Management Science 35, 164–176 (1989)CrossRefMathSciNetzbMATHGoogle Scholar
  8. 8.
    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)CrossRefGoogle Scholar
  9. 9.
    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)Google Scholar
  10. 10.
    Focacci, F., Lodi, A.: Solving TSP with Time Windows with Constraints. In: International Conference on Logic Programming, pp. 515–529 (1999)Google Scholar
  11. 11.
    ILOG SOLVER 5.2 User’s Manuel, ILOG (2000) Google Scholar
  12. 12.
    ILOG SCHEDULER 5.2 User’s Manuel, ILOG (2000) Google Scholar
  13. 13.
    Nowicki, E., Smutnicki, C.: A fast taboo search algorithm for the job shop problem. Management Science 42, 797–813 (1996)CrossRefzbMATHGoogle Scholar
  14. 14.
    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)CrossRefzbMATHGoogle Scholar
  15. 15.
    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)CrossRefzbMATHGoogle Scholar
  16. 16.
    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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Christian Artigues
    • 1
  • Sana Belmokhtar
    • 2
  • Dominique Feillet
    • 1
  1. 1.Laboratoire d’Informatique d’AvignonFRE CNRS 2487 Université d’Avignon, AgroparcAvignon Cedex 9France
  2. 2.MSGI-G2I, Ecole des Mines de Saint EtienneSaint Etienne Cedex 2France

Personalised recommendations