Skip to main content

Advertisement

Springer Nature Link
Log in

No-wait Job Shop Scheduling: Tabu Search and Complexity of Subproblems

  • Original Article
  • Published:
Mathematical Methods of Operations Research Aims and scope Submit manuscript

Abstract

This paper deals with the no-wait job shop problem with a makespan objective. We present some new theoretical properties on the complexity of subproblems associated with a well-known decomposition approach. Justified by the complexity results, we implement a fast tabu search algorithm for the problem at hand. It is extensively tested on known benchmark instances and compares favorably to the best existing algorithms for the no-wait job shop as well as the no-wait flow shop.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Aldowaisan T, Allahverdi A (2003) New heuristics for no-wait flowshops to minimize makespan. Comput Oper Res 30:1219–1231

    Article  MATH  Google Scholar 

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

    MATH  Google Scholar 

  • Balas E (1979) Disjunctive programming. Ann Discrete Math 5:3–51

    MATH  MathSciNet  Google Scholar 

  • Balas E, Vazacopoulos A (1998) Guided local search with shifting bottleneck for job-shop- scheduling. Manage Sci 44:262–275

    MATH  Google Scholar 

  • Blazewicz J, Domschke W, Pesch E (1996) The job-shop-scheduling-problem: conventional and new solution techniques. Eur J Oper Res 93:1–33

    Article  MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  • Carlier J (1978) Ordonnancements à contraintes disjonctives. R.A.I.R.O. Recherche opérationnelle/Oper Res 12:333–351

    MATH  MathSciNet  Google Scholar 

  • Fisher H, Thompson GL (1963) Industrial scheduling, chapter~probabilistic learning combinations of local job-shop scheduling rules, pp 225–251. Prentice Hall, Englewood Cliffs

  • Glover F (1989) Tabu search – part i. ORSA J Comput 1:190–206

    MATH  MathSciNet  Google Scholar 

  • Glover F (1990) Tabu search – part ii. ORSA J Comput 2:4–32

    MATH  Google Scholar 

  • Grabowski J, Pempera J (2000) Sequencing of jobs in some production system. Eur J Oper Res 125:535–550

    Article  MATH  MathSciNet  Google Scholar 

  • Grabowski J, Wodecki M (2003) A very fast tabu search algorithm for the job shop problem with makespan criterion. Comput Oper Res (to appear)

  • Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math. 5:287–326

    Article  MATH  MathSciNet  Google Scholar 

  • Guinet A, Legrand M (1998) Reduction of job-shop-problems to flow-shop-problems with precedence constraints. Eur J Oper Res 109:96–110

    Article  MATH  Google Scholar 

  • Hall NG, Sriskandarajah C (1996) A survey of machine scheduling-problems with blocking and no-wait in process. Oper Res 44:510–525

    MATH  MathSciNet  Google Scholar 

  • Heller J (1960) Some numerical experiments for an M × J flow shop and its decision-theoretical aspects. Oper Res 8:178–184

    MATH  MathSciNet  Google Scholar 

  • Jain A, Meeran S (1999) Deterministic job-shop-scheduling: past, present and future. Eur J Oper Res 113:390–434

    Article  MATH  Google Scholar 

  • Lawrence S (1984) Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques. Technical report, Carnegie-Mellon University, Pittsburgh

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

    MATH  MathSciNet  Google Scholar 

  • Macchiaroli R, Mole S, Riemma S (1999) Modelling and optimization of industrial manufacturing processes subject to no-wait constraints. Inter J Prod Res 37:2585–2607

    Article  MATH  Google Scholar 

  • Martin P, Shmoys DB (1996) A new approach to computing optimal schedules for the job-shop-scheduling-problem. IPCO’96, pp 389–403, Vancouver, British Columbia

  • Mascis A, Pacciarelli D (2000) Machine scheduling via alternative graphs. Technical report, Report DIA 46-2000, Dipartimento di Informatica e Automazione, Università Roma Tre

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

    Article  MathSciNet  Google Scholar 

  • Meloni C, Pacciarelli D, Pranzo M (2002) A rollout metaheuristic for job-shop-scheduling- problems. Ann Oper Res (to appear)

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

    MATH  Google Scholar 

  • Ovacik I, Uzsoy R (1997). Decomposition methods for complex factory scheduling-problems. Kluwer, Dordrecht

    Google Scholar 

  • Pezzella F, Merelli E (2000) A tabu search method guided by shifting bottleneck for the job-shop-scheduling-problem. Eur J Oper Res 120:297–310

    Article  MATH  MathSciNet  Google Scholar 

  • Raaymakers W, Hoogeveen J (2000) Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing. Eur J Oper Res 126:131–151

    Article  MATH  Google Scholar 

  • Rajendran C (1994) A no-wait flowshop scheduling heuristic to minimize makespan. J Oper Res Soc 45:472–478

    Article  MATH  Google Scholar 

  • Reddi S, Ramamoorthy C (1973) A scheduling-problem. Oper Res Q 24:441–446

    Article  MATH  MathSciNet  Google Scholar 

  • Reeves CR (1995) A genetic algorithm for flowshop sequencing. Comput Oper Res 22:5–13

    Article  MATH  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  • Schuster CJ (2003) No-wait job shop scheduling: Komplexität und Local Search (in German). Institute of Mathematics, Dissertation Thesis, University of Duisburg-Essen, Germany

  • Schuster CJ, Framinan J (2003) Approximative procedures for no-wait job shop scheduling. Oper Res Lett 31:308–318

    Article  MATH  MathSciNet  Google Scholar 

  • Storer RH, Wu SD, Vaccari R (1992) New search spaces for sequencing instances with application to job shop scheduling. Manage Sci 38:1495–1509

    MATH  Google Scholar 

  • Wismer DA (1972) Solution of the flowshop scheduling-problem with no intermediate queues. Oper Res 20:689–697

    MATH  Google Scholar 

  • Woeginger GJ (2004) Inapproximability results for no-wait job shop scheduling. Oper Res Lett 32:320–325

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Bayer Business Services, LOG-PW Solutions for Planning and Warehouse Management, 51368, Leverkusen, Germany

    Christoph J. Schuster

Authors
  1. Christoph J. Schuster
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Christoph J. Schuster.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Schuster, C.J. No-wait Job Shop Scheduling: Tabu Search and Complexity of Subproblems. Math Meth Oper Res 63, 473–491 (2006). https://doi.org/10.1007/s00186-005-0056-y

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00186-005-0056-y

Keywords

Mathematics Subject Classification (2000)