Skip to main content
SpringerLink
Log in

A new exact algorithm for no-wait job shop problem to minimize makespan

  • Original Paper
  • Published:
Operational Research Aims and scope Submit manuscript

Abstract

In this paper, the no-wait job shop scheduling problem with a makespan objective is considered. A new exact algorithm, which is based on the dynamic programming (DP), is proposed. We introduce a dominance relation between two timetables. Several theorems are provided showing the application of the dominance. Despite the theoretical interest, experimental results prove that the proposed algorithm is able to optimally solve moderate benchmark instances within a reasonable time limit. Moreover, we have shown that the use of the dominance effectively reduces the state space of the algorithm. As an extension of the DP algorithm, we also present its heuristic version. It is shown that good quality upper bounds for large-size benchmark instances can be obtained. A comparison among several algorithms presented in the literature shows that the DP algorithm is quite competitive in terms of the computational time and the quality of obtained solutions.

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.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

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

    Article  Google Scholar 

  • Bozejko W, Makuchowski M (2009) A fast hybrid tabu search algorithm for the no-wait job shop problem. Comput Ind Eng 56(4):1502–1509

    Article  Google Scholar 

  • Bürgy R, Gröflin H (2013) Optimal job insertion in the no-wait job shop. J Combin Optim 26(2):345–371

    Article  Google Scholar 

  • Carlier J, Pinson É (1989) An algorithm for solving the job-shop problem. Manag Sci 35(2):164–176

    Article  Google Scholar 

  • Fisher H, Thompson G (1963) Probabilistic learning combinations of local job-shop scheduling rules. Ind Sched 3(2):225–251

    Google Scholar 

  • Framinan JM, Schuster C (2006) An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach. Comput Oper Res 33(5):1200–1213

    Article  Google Scholar 

  • Gromicho J, Van Hoorn J, Saldanha-da Gama F, Timmer G (2012) Solving the job-shop scheduling problem optimally by dynamic programming. Comp Oper Res 39(12):2968–2977

    Article  Google Scholar 

  • Lawrence S (1984) Supplement to resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques. Carnegie Mellon University, Pittsburgh

    Google Scholar 

  • Lennartz P (2006) No-wait job shop scheduling, a constraint propagation approach. PhD thesis, Utrecht University

  • Lenstra J, Rinnooy Kan A (1979) Computational complexity of discrete optimization problems. Ann Discrete Math 4:121–140

    Article  Google Scholar 

  • Li X, Xu H, Li M (2016) A memory-based complete local search method with variable neighborhood structures for no-wait job shops. Int J Adv Manuf Technol 87(5–8):1401–1408

    Article  Google Scholar 

  • Mascis A, Pacciarelli D (2002) Job-shop scheduling with blocking and no-wait constraints. Eur J Oper Res 143(3):498–517

    Article  Google Scholar 

  • Ozolins A (2017) Improved bounded dynamic programming algorithm for solving the blocking flow shop problem. Central Eur J Oper Res. https://doi.org/10.1007/s10100-017-0488-5

    Article  Google Scholar 

  • Ozolins A (2018) Bounded dynamic programming algorithm for the job shop problem with sequence dependent setup times. Oper Res Int J. https://doi.org/10.1007/s12351-018-0381-6

    Article  Google Scholar 

  • Sahni S, Cho Y (1979) Complexity of scheduling shops with no wait in process. Math Oper Res 4(4):448–457

    Article  Google Scholar 

  • Schuster C (2006) No-wait job shop scheduling: tabu search and complexity of subproblems. Math Methods Oper Res 63(3):473–491

    Article  Google Scholar 

  • Storer R, Wu S, Vaccari R (1992) New search spaces for sequencing problems with application to job shop scheduling. Manag Sci 38(10):1495–1509

    Article  Google Scholar 

  • Sundar S, Suganthan P, Jin C, Xiang C, Soon C (2016) A hybrid artificial bee colony algorithm for the job-shop scheduling problem with no-wait constraint. Soft Comput 21:1–10

    Google Scholar 

  • van den Broek J (2009) Mip-based approaches for complex planning problems. Ph.D. thesis, Eindhoven University of Technology

  • van Hoorn J (2016) Dynamic programming for routing and scheduling: optimizing sequences of decisions. Ph.D. thesis, VU University Amsterdam

  • Zhu J, Li X (2012) An effective meta-heuristic for no-wait job shops to minimize makespan. IEEE Trans Autom Sci Eng 9(1):189–198

    Google Scholar 

  • Zhu J, Li X, Wang Q (2009) Complete local search with limited memory algorithm for no-wait job shops to minimize makespan. Eur J Oper Res 198(2):378–386

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Latvia, Zellu Street 25, Riga, 1002, Latvia

    A. Ozolins

Authors
  1. A. Ozolins
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. Ozolins.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ozolins, A. A new exact algorithm for no-wait job shop problem to minimize makespan. Oper Res Int J 20, 2333–2363 (2020). https://doi.org/10.1007/s12351-018-0414-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12351-018-0414-1

Keywords

Search

Navigation