Advertisement

Annals of Operations Research

, Volume 159, Issue 1, pp 135–159 | Cite as

A branch and bound method for the job-shop problem with sequence-dependent setup times

  • Christian ArtiguesEmail author
  • Dominique Feillet
Article

Abstract

This paper deals with the job-shop scheduling problem with sequence-dependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The method is based on iterative solving via branch and bound decisional versions of the problem. At each node of the branch and bound tree, constraint propagation algorithms adapted to setup times are performed for domain filtering and feasibility check. Relaxations based on the traveling salesman problem with time windows are also solved to perform additional pruning. The traveling salesman problem is formulated as an elementary shortest path problem with resource constraints and solved through dynamic programming. This method allows to close previously unsolved benchmark instances of the literature and also provides new lower and upper bounds.

Keywords

Job-shop scheduling Sequence-dependent setup times Branch and bound Constraint propagation Dynamic programming 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adams, J., Balas, E., & Zawack, D. (1988). The shifting bottleneck procedure for job-shop scheduling. Management Science, 34, 391–401. Google Scholar
  2. Allahverdi, A., Gupta, J. N. D., & Aldowaisan, T. (1999). A review of scheduling research involving setup considerations. Omega, 27, 219–239. CrossRefGoogle Scholar
  3. Artigues, C., Belmokhtar, S., & Feillet, D. (2004). A new exact solution algorithm for the job shop problem with sequence-dependent setup times. In J. C. Régin & M. Rueher (Eds.), 1st international conference on integration of AI and OR techniques in constraint programming for combinatorial optimization problems : Vol. 3011. Lecture notes in computer science (pp. 37–49). Berlin: Springer. Google Scholar
  4. Artigues, C., Buscaylet, F., & Feillet, D. (2005a). Lower and upper bound for the job shop scheduling problem with sequence-dependent setup times. In Proceedings of the second multidisciplinary international conference on scheduling: theory and applications (MISTA’2005). New York. Google Scholar
  5. Artigues, C., Lopez, P., & Ayache, P. D. (2005b). Schedule generation schemes and priority rules for the job-shop problem with sequence-dependent setup times: Dominance properties and computational analysis. Annals of Operations Research, 138(1), 21–52. CrossRefGoogle Scholar
  6. Balas, E. (1996). New classes of efficiently solvable generalized traveling salesman problems (Technical Report #MSRR-615). Graduate School of Industrial Administration, Carnegie Mellon University. Google Scholar
  7. Balas, E., & Simonetti, N. (2001). Linear time dynamic programming algorithms for new classes of restricted TSPs. INFORMS, Journal on Computing, 13, 56–75. CrossRefGoogle Scholar
  8. Balas, E., Simonetti, N., & Vazacopoulos, A. (2005). Job shop scheduling with setup-times, deadlines and precedence constraints. In Proceedings of the second multidisciplinary international conference on scheduling: theory and applications (MISTA’2005). New York. Google Scholar
  9. Baptiste, P., Le Pape, C., & Nuijten, W. (2001). In Constraint-based scheduling : Vol. 39. International series in operations research & management science. Berlin: Springer. Google Scholar
  10. Blazewicz, J., Domschke, W., & Pesch, E. (1996). The job shop scheduling problem: Conventional and new solution techniques. European Journal of Operational Research, 93(1), 1–33. CrossRefGoogle Scholar
  11. Brucker, P., & Thiele, O. (1996). A branch and bound method for the general-shop problem with sequence-dependent setup times. Operations Research Spektrum, 18, 145–161. CrossRefGoogle Scholar
  12. Brucker, P., Jurisch, P., & Krämer, A. (1994a). The job-shop problem and immediate selection. Annals of Operations Research, 50, 73–114. CrossRefGoogle Scholar
  13. Brucker, P., Jurisch, P., & Sievers, B. (1994b). A fast branch and bound algorithm for the job-shop scheduling problem. Discrete Applied Mathematics, 49, 107–127. CrossRefGoogle Scholar
  14. Buscaylet, F., & Artigues, C. (2003). A fast tabu search method for the job-shop problem with sequence-dependent setup times. In Metaheuristic international conference MIC’2003. Google Scholar
  15. Candido, M. A. B., Khator, S. K., & Barcias, R. M. (1998). A genetic algorithm based procedure for more realistic job shop scheduling problems. International Journal of Production Research, 36(12), 3437–3457. CrossRefGoogle Scholar
  16. Carlier, J. (1982). The one machine sequencing problem. European Journal of Operational Research, 11, 42–47. CrossRefGoogle Scholar
  17. Carlier, J., & Pinson, E. (1989). An algorithm for solving the job-shop problem. Management Science, 35, 164–176. Google Scholar
  18. Choi, I.-C., & Korkmaz, O. (1997). Job shop scheduling with separable sequence-dependent setups. Annals of Operations Research, 70, 155–170. CrossRefGoogle Scholar
  19. Choi, I.-N., & Choi, D.-S. (2002). A local search algorithm for job-shop scheduling problems with alternative operations and sequence-dependent setups. Computers and Industrial Engineering, 42, 43–58. CrossRefGoogle Scholar
  20. Conway, R. W., Maxwell, W. L., & Miller, L. W. (1967). Theory of scheduling. Reading: Addison–Wesley. Google Scholar
  21. Demassey, S., Artigues, C., & Michelon, P. (2005). Constraint propagation-based cutting planes: an application to the resource-constrained project scheduling problem. INFORMS Journal on Computing, 17(1), 52–65. CrossRefGoogle Scholar
  22. Feillet, D., Dejax, P., Gendreau, M., & Gueguen, C. (2004). An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems. Networks, 44(3), 216–229. CrossRefGoogle Scholar
  23. 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). Google Scholar
  24. Focacci, F., Lodi, A., & Milano, M. (2002). A hybrid exact algorithm for the tsptw. INFORMS, Journal on Computing, 14, 403–417. CrossRefGoogle Scholar
  25. Jain, A. S., & Meeran, S. (1999). Deterministic job-shop scheduling: Past, present and future. European Journal of Operational Research, 113(2), 390–434. CrossRefGoogle Scholar
  26. Kim, S. C., & Bobrowski, P. M. (1994). Impact of sequence-dependent setup time on job shop scheduling performance. International Journal of Production Research, 32(7), 1503–1520. CrossRefGoogle Scholar
  27. Kolisch, R. (1996). Serial and parallel resource-constrained project scheduling methods revisited: theory and computation. European Journal of Operational Research, 90, 320–333. CrossRefGoogle Scholar
  28. Lawrence, S. (1984). Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques (supplement) (Technical report). Graduate School of Industrial Administration, Carnegie Mellon University. Google Scholar
  29. Martin, P., & Shmoys, D. B. (1996). A new approach to computing optimal schedules for the job-shop scheduling problem. In W. H. Cunningham, S. T. McCormick & M. Queyranne (Eds.), Proceedings of the 5th international conference on integer programming and combinatorial optimization IPCO’96 (pp. 389–403). Vancouver, British Columbia, Canada. Google Scholar
  30. Mason, S. J., Fowler, J. W., & Matthew Carlyle, W. (2002). A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops. Journal of Scheduling, 5(3), 247–262. CrossRefGoogle Scholar
  31. Noivo, J. A., & Ramalhinho-Lourenço, H. (1998). Solving two production scheduling problems with sequence-dependent set-up times (Technical Report No. 138). Department of Economics and Business, Universitat Pompeu Fabra, Barcelona. Google Scholar
  32. Nowicki, E., & Smutnicki, C. (1996). A fast taboo search algorithm for the job shop problem. Management Science, 42, 797–813. Google Scholar
  33. Nuijten, W. P. M. (1994). Time and resource constrained scheduling: a constraint satisfaction approach. Eindhoven University of Technology: Ph.D. thesis. Google Scholar
  34. Ovacik, I. M., & Uzsoy, R. (1992). A shifting bottleneck algorithm for scheduling semiconductor testing operations. Journal of Electronics Manufacturing, 2, 119–134. CrossRefGoogle Scholar
  35. Ovacik, I. M., & Uzsoy, R. (1994a). Exploiting shop floor status information to schedule complex job shop. Journal of manufacturing systems, 13, 73–84. CrossRefGoogle Scholar
  36. Ovacik, I. M., & Uzsoy, R. (1994b). Rolling horizon algorithms for a single machine dynamic scheduling problem with sequence-dependent setup times. International Journal of Production Research, 32(6), 1243–1263. CrossRefGoogle Scholar
  37. Peridy, L. (1996). Le problème de job-shop: arbitrages et adjustments. Université de Technologie de Compiègne: Ph.D. thesis. Google Scholar
  38. Roy, B., & Sussman, B. (1964). Les problèmes d’ordonnancement avec contraintes disjonctives (Technical Report Note DS No. 9bis). SEMA, Paris. Google Scholar
  39. Savelsberg, M. W. P. (1985). Local search in routing problems with time windows. Annals of Operations Research, 4, 285–305. CrossRefGoogle Scholar
  40. Schutten, J. M. J. (1995). Practical job shop scheduling (Technical Report LPOM-95-12). Laboratory of Production and Operations Management, Department of Mechanical Engineering, University of Twente, The Netherlands. Google Scholar
  41. Sun, X., & Noble, J. S. (1999). A modified shifting bottleneck approach to job shop scheduling with sequence dependent setups. Journal of Manufacturing Systems, 18(6), 416–430. CrossRefGoogle Scholar
  42. Torres, P., & Lopez, P. (2000). Overview and possible extensions of shaving techniques for job-shop problems. In Proceedings of the workshop on integration of AI and OR techniques in constraint programming for combinatorial optimization problems, CPAIOR’00 (pp. 181–186). Paderborn, Germany. Google Scholar
  43. Vaessens, R. J. M., Aarts, E. H. L., & Lenstra, J. K. (1996). Job shop scheduling by local search. INFORMS Journal on Computing, 8, 302–317. Google Scholar
  44. Vilím, P., & Barták, R. (2002). Filtering algorithms for batch processing with sequence dependent setup times. In M. Ghallab, J. Hertzberg & P. Traverso (Eds.), Proceedings of the sixth international conference on artificial intelligence planning and scheduling (AIPS 2002) (pp. 312–320). Menlo Park: AAAI Press. Google Scholar
  45. Wilbrecht, J. K., & Prescott, W. B. (1969). The influence of setup time on job shop performance. Management Science, 16(4), B274–B280. Google Scholar
  46. Zhou, C., & Egbelu, P. G. (1989). Scheduling in manufacturing shop with sequence-dependent setups. Robotics and Computer Integrated Manufacturing, 5, 73–81. CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2007

Authors and Affiliations

  1. 1.Université de Toulouse, LAAS–CNRSToulouseFrance
  2. 2.LIA—Université d’AvignonAvignon Cedex 9France

Personalised recommendations