Skip to main content

Advertisement

SpringerLink
Log in

Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

The Job Shop Scheduling Problem (JSP) is an example of a combinatorial optimization problem that has interested researchers for several decades. In this paper we confront an extension of this problem called JSP with Sequence Dependent Setup Times (SDST-JSP). The approach extends a genetic algorithm and a local search method that demonstrated to be efficient in solving the JSP. For local search, we have formalized neighborhood structures that generalize three well-know structures defined for the JSP. We have conducted an experimental study across conventional benchmark instances showing that the genetic algorithm exploited in combination with the local search, considering all three neighborhoods at the same time, provides the best results. Moreover, this approach outperforms the current state-of-the-art methods.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Adams, J., Balas, E., D., Z.: The shifting bottleneck procedure for jobshop scheduling. Manag. Sci. 34, 391–401 (1988)

    Article  MATH  Google Scholar 

  • Allahverdi, A., Gupta, J., Aldowaisan, T.: A review of scheduling research involving setup considerations. Omega 27, 219–239 (1999)

    Article  Google Scholar 

  • Applegate, D., Cook, W.: A computational study of the job-shop scheduling problem. ORSA J. Comput. 3, 149–156 (1991)

    MATH  Google Scholar 

  • Armentano, V.A., Basi de Araujo, O.C.: Grasp with memory-based mechanisms for minimizing total tardiness in single machine scheduling with setup times. J. Heuristics 12(869), 427–446 (2006)

    Article  Google Scholar 

  • Artigues, C., Feillet, D.: A branch and bound method for the job-shop problem with sequence-dependent setup times. Ann. Oper. Res. 159(1), 135–159 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  • Artigues, C., Lopez, P.: Extending Giffler-Thompson algorithm to generate active schedules for job-shops with sequence-dependent setup times. LIA Report 129, University of Avignon (2000)

  • Artigues, C., Belmokhtar, S., Feillet, D.: A new exact solution algorithm for the job shop problem with sequence-dependent setup times. In: Régin, J.C., Rueher, M. (eds.) 1st International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. LNCS, vol. 3011, pp. 37–49. Springer, Berlin (2004)

    Google Scholar 

  • Artigues, C., Buscaylet, F., Feillet, D.: 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) (2005a)

  • Artigues, C., Lopez, P., Ayache, P.: Schedule generation schemes for the job shop problem with sequence-dependent setup times: Dominance properties and computational analysis. Ann. Oper. Res. 138, 21–52 (2005b)

    Article  MATH  MathSciNet  Google Scholar 

  • Aydin, E., Fogarty, T.C.: A distributed evolutionary simulated annealing algorithm for combinatorial optimisation problems. J. Heuristics 10(3), 269–292 (2004)

    Article  Google Scholar 

  • Balas, E., Simonetti, N., Vazacopoulos, A.: Job shop scheduling with set-up times, deadlines and precedence constraints. In: Proceedings of MISTA’2005 (2005)

  • Bierwirth, C.: A generalized permutation approach to jobshop scheduling with genetic algorithms. Oper. Res. Spectrum 17, 87–92 (1995)

    Article  MATH  Google Scholar 

  • Brucker, P.: Scheduling Algorithms, 4th edn. Springer, Berlin (2004)

    MATH  Google Scholar 

  • Brucker, P., Thiele, O.: A branch and bound method for the general-job shop problem with sequence-dependent setup times. Oper. Res. Spektrum 18, 145–161 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  • Brucker, P., Jurisch, B., Sievers, B.: A branch and bound algorithm for the job-shop scheduling problem. Discrete Appl. Math. 49, 107–127 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  • Buscaylet, F., Artigues, C.: A fast tabu search method for the job-shop problem with sequence-dependent setup times. In: Fifth Metaheuristics International Conference MIC2003 (Kyoto) (2003)

  • Candido, M., Khator, S., Barcias, R.: A genetic algorithm based procedure for more realistic job shop scheduling problems. Int. J. Prod. Res. 36(12), 3437–3457 (1998)

    Article  MATH  Google Scholar 

  • Carlier, J., Pinson, E.: An algorithm for solving the job shop problem. Manag. Sci. 35, 166–176 (1989)

    Article  MathSciNet  Google Scholar 

  • Carlier, J., Pinson, E.: Adjustment of heads and tails for the job-shop problem. Eur. J. Oper. Res. 78, 146–161 (1994)

    Article  MATH  Google Scholar 

  • Cheung, W., Zhou, H.: Using genetic algorithms and heuristics for job shop scheduling with sequence-dependent setup times. Ann. Oper. Res. 107, 65–81 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  • Choi, I., Choi, D.: A local search algorithm for jobshop scheduling problems with alternative operations and sequence-dependent setups. Eur. J. Oper. Res. 90, 252–268 (2002)

    Google Scholar 

  • Choi, I., Korkmaz, O.: Job shop scheduling with separable sequence-dependent setup times. Ann. Oper. Res. 70, 155–170 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  • Dell’ Amico, M., Trubian, M.: Applying tabu search to the job-shop scheduling problem. Ann. Oper. Res. 41, 231–252 (1993)

    Article  MATH  Google Scholar 

  • Demirkol, E., Mehta, S., Uzsoy, R.: A computational study of shifting bottleneck procedures for shop scheduling problems. J. Heuristics 3(2), 111–137 (1997)

    Article  MATH  Google Scholar 

  • Focacci, F., Laborie, P., Nuijten, W.: Solving scheduling problems with setup times and alternative resources. In: Proceedings of Fifth International Conference on Artificial Intelligence Planning and Scheduling, pp. 91–101 (2000)

  • Giffler, B., Thomson, G.: Algorithms for solving production scheduling problems. Oper. Res. 8, 487–503 (1960)

    Article  MATH  Google Scholar 

  • Goldberg, D.: Genetic Algorithms in Search. Optimization and Machine Learning. Addison-Wesley, Reading (1985)

    Google Scholar 

  • González, M., Sierra, M., Vela, C., Varela, R.: Genetic algorithms hybridized with greedy algorithms and local search over the spaces of active and semi-active schedules. In: Current Topics in Artificial Intelligence. 11th Conference of the Spanish Association for Artificial Intelligence, CAEPIA 2005. LNCS, vol. 4177, pp. 231–240. Springer, Berlin (2006a). Revised Selected Papers

    Chapter  Google Scholar 

  • González, M., Sierra, M., Vela, C., Varela, R., Puente, J.: Combining metaheuristics for the job shop scheduling problem with sequence dependent setup times. In: Proceedings of the First International Conference on Software and Data Technologies, ICSOFT’2006, pp. 211–220 (2006b)

  • Holland, J.H.: Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence. The University of Michigan Press, Ann Arbor (1975)

    Google Scholar 

  • Ives, P., Lambrecht, M.: Extending the shifting bottleneck procedure to real-life applications. Eur. J. Oper. Res. 90(3), 252–268 (1996)

    Google Scholar 

  • Jain, A.S., Rangaswarny, B., Meeran, S.: New and “stronger” job-shop neighbourhoods: A focus on the method of Nowicki and Smutnicki (1996). J. Heuristics 6(4), 457–480 (2000)

    Article  MATH  Google Scholar 

  • Kim, S., Bobrowski, P.: Impact of sequence-dependent setup time on job shop scheduling performance. Int. J. Prod. Res. 32(7), 1503–1520 (1994)

    Article  MATH  Google Scholar 

  • Lawrence, S.: Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques (supplement). Technical Report, Graduate School of Industrial Administration, Carnegie Mellon University (1984)

  • Matsuo, H., Suh, C., Sullivan, R.: A controlled search simulated annealing method for the general jobshop scheduling problem. Working Paper 03-44-88, Graduate School of Business, University of Texas (1988)

  • Mattfeld, D.: Evolutionary Search and the Job Shop. Investigations on Genetic Algorithms for Production Scheduling. Springer, Berlin (1995)

    Google Scholar 

  • Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Program, 2nd, Extended edn Springer, Berlin (1994)

    Google Scholar 

  • Miller, D., Chen, H.-C., Matson, J., Liu, Q.: A hybrid genetic algorithm for the single machine scheduling problem. J. Heuristics 5(4), 437–454 (1999)

    Article  MATH  Google Scholar 

  • Mönch, L., Schabacker, R., Pabst, D., Fowler, J.: Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops. Eur. J. Oper. Res. 177(3), 2100–2118 (2007)

    Article  MATH  Google Scholar 

  • Noivo, A., Ramalhinho-Lourenço, H.: Solving two production scheduling problems with sequence-dependent set-up times. Technical Report 138, Department of Economic and Business, Universitat Pompeu Fabra, Barcelona (1998)

  • Nowicki, E., Smutnicki, C.: A fast taboo search algorithm for the job shop problem. Manag. Sci. 42, 797–813 (1996)

    Article  MATH  Google Scholar 

  • Rios-Mercado, R.Z., Bard, J.F.: An enhanced tsp-based heuristic for makespan minimization in a floor shop with setup times. J. Heuristics 5(1), 53–70 (1999)

    Article  MATH  Google Scholar 

  • Roy, B., Sussmann, B.: Les problèmes d’ordonnancement avec constraintes disjonctives. Note DS n.6 bis, SEMA, Matrouge, 6 (1964)

  • Taillard, E.: Parallel taboo search techniques for the job shop scheduling problem. ORSA J. Comput. 6, 108–117 (1993)

    Google Scholar 

  • Van Laarhoven, P., Aarts, E., Lenstra, K.: Job shop scheduling by simulated annealing. ORSA J. Comput. 40, 113–125 (1992)

    MATH  Google Scholar 

  • Varela, R., Vela, C., Puente, J., Gomez, A.: A knowledge-based evolutionary strategy for scheduling problems with bottlenecks. Eur. J. Oper. Res. 145, 57–71 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  • Varela, R., Serrano, D., Sierra, M.: New codification schemas for scheduling with genetic algorithms. In: Proceedings of the First International Work-conference on the Interplay between Natural and Artificial Computation, IWINAC 2005. LNCS, vol. 3562, pp. 11–20. Springer, Berlin (2005)

    Google Scholar 

  • Wilbrech, J., Prescott, W.: The influence of setup time on job shop performance. Manag. Sci. 16(4), 391–401 (1969)

    Google Scholar 

  • Yamada, T., Nakano, R.: Scheduling by genetic local search with multi-step crossover. In: Fourth Int. Conf. on Parallel Problem Solving from Nature (PPSN IV), pp. 960–969 (1996)

  • Zhou, Y., Li, B., Yang, J.: Study on job shop scheduling with sequence-dependent setup times using biological immune algorithm. Int. J. Adv. Manuf. Technol. 30(1–2), 105–111 (2006)

    Article  MathSciNet  Google Scholar 

  • Zoghby, J., Barnes, J., J.J., H.: Modeling the re-entrant job shop scheduling problem with setup for metaheuristic searches. Eur. J. Oper. Res. 167, 336–348 (2005)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computing Technologies Group, Department of Computing, Artificial Intelligence Center, University of Oviedo, Campus of Viesques, 33271, Gijón, Spain

    Camino R. Vela, Ramiro Varela & Miguel A. González

Authors
  1. Camino R. Vela
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ramiro Varela
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Miguel A. González
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ramiro Varela.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Vela, C.R., Varela, R. & González, M.A. Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times. J Heuristics 16, 139–165 (2010). https://doi.org/10.1007/s10732-008-9094-y

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10732-008-9094-y

Keywords

Search

Navigation