Advertisement

Dynamic programming approach for solving the open shop problem

  • Ansis OzolinsEmail author
Article
  • 19 Downloads

Abstract

This paper deals with the open shop scheduling problem (OSP) with makespan minimization. An exact dynamic programming algorithm is proposed for solving the OSP to optimality. This approach is applied to the OSP for the first time. Computational results show that the proposed algorithm is able to solve moderate benchmark instances.

Keywords

Open shop scheduling Makespan Dynamic programming 

Notes

References

  1. Blum C (2005) Beam-acohybridizing ant colony optimization with beam search: an application to open shop scheduling. Comput Oper Res 32(6):1565–1591CrossRefGoogle Scholar
  2. Brucker P, Hurink J, Jurisch B, Wöstmann B (1997) A branch and bound algorithm for the open-shop problem. Discrete Appl Math 76(1–3):43–59CrossRefGoogle Scholar
  3. Colak S, Agarwal A (2005) Non-greedy heuristics and augmented neural networks for the open-shop scheduling problem. Nav Res Logist 52(7):631–644CrossRefGoogle Scholar
  4. Dorndorf U, Pesch E, Phan-Huy T (2001) Solving the open shop scheduling problem. J Sched 4(3):157–174CrossRefGoogle Scholar
  5. Gonzalez T, Sahni S (1976) Open shop scheduling to minimize finish time. J ACM 23(4):665–679CrossRefGoogle Scholar
  6. Grimes D, Hebrard E, Malapert A (2009) Closing the open shop: contradicting conventional wisdom. In: Principles and Practice of Constraint Programming-CP, vol 2009, pp 400–408Google Scholar
  7. Gromicho J, Van Hoorn J, Saldanha-da Gama F, Timmer G (2012) Solving the job-shop scheduling problem optimally by dynamic programming. Comput Oper Res 39(12):2968–2977CrossRefGoogle Scholar
  8. Guéret C, Prins C (1999) Forbidden intervals for open-shop problems. In: IFORS’99Google Scholar
  9. Guéret C, Jussien N, Prins C (2000) Using intelligent backtracking to improve branch-and-bound methods: an application to open-shop problems. Eur J Oper Res 127(2):344–354CrossRefGoogle Scholar
  10. Harmanani HM, Ghosn SB (2016) An efficient method for the open-shop scheduling problem using simulated annealing. In: Information technology: New generations, Springer, pp 1183–1193Google Scholar
  11. Malapert A, Cambazard H, Guéret C, Jussien N, Langevin A, Rousseau LM (2012) An optimal constraint programming approach to the open-shop problem. INFORMS J Comput 24(2):228–244CrossRefGoogle Scholar
  12. Ozolins A (2018) Bounded dynamic programming algorithm for the job shop problem with sequence dependent setup times. Oper Res pp 1–28Google Scholar
  13. Ozolins A (2019) Improved bounded dynamic programming algorithm for solving the blocking flow shop problem. Central Eur J Oper Res 27(1):15–38CrossRefGoogle Scholar
  14. Pongchairerks P, Kachitvichyanukul V (2016) A two-level particle swarm optimisation algorithm for open-shop scheduling problem. Int J Comput Sci Math 7(6):575–585CrossRefGoogle Scholar
  15. Prins C (2000) Competitive genetic algorithms for the open-shop scheduling problem. Math Methods Oper Res 52(3):389–411CrossRefGoogle Scholar
  16. Sha D, Hsu CY (2008) A new particle swarm optimization for the open shop scheduling problem. Comput Oper Res 35(10):3243–3261CrossRefGoogle Scholar
  17. Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Oper Res 64(2):278–285CrossRefGoogle Scholar
  18. Tamura N, Taga A, Kitagawa S, Banbara M (2009) Compiling finite linear CSP into SAT. Constraints 14(2):254–272CrossRefGoogle Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2019

Authors and Affiliations

  1. 1.University of LatviaRigaLatvia

Personalised recommendations