No-wait job shop scheduling: Tabu search and complexity of subproblems

Mathematical Methods of Operations Research

Volumn 63, Issue 3, 2006, Pages 473-491

  Schuster, Christoph J ^a  

^a BAYER AG   (Germany)

Author keywords

Complexity; Decomposition; Flow shop; Job shop; No wait; Scheduling; Tabu search

Indexed keywords

ALGORITHMS; BENCHMARKING; COMPUTATIONAL COMPLEXITY; DECOMPOSITION; JOB ANALYSIS; PROBLEM SOLVING;

COMPLEXITY; FLOW SHOP; JOB SHOP; NO-WAIT; TABU SEARCH;

SCHEDULING;

EID: 33746053254     PISSN: 14322994     EISSN: 14325217     Source Type: Journal    
DOI: 10.1007/s00186-005-0056-y     Document Type: Article

References (37)

1. Aldowaisan T, Allahverdi A (2003) New heuristics for no-wait flowshops to minimize makespan. Comput Oper Res 30:1219-1231
2. Applegate D, Cook W (1991) A computational study of the job-shop problem. ORSA Comput 3:149-156
3. Balas E (1979) Disjunctive programming. Ann Discrete Math 5:3-51
4. Balas E, Vazacopoulos A (1998) Guided local search with shifting bottleneck for job-shop-scheduling. Manage Sci 44:262-275
5. Blazewicz J, Domschke W, Pesch E (1996) The job-shop-scheduling-problem: conventional and new solution techniques. Eur J Oper Res 93:1-33
6. Brucker P, Jurisch B, Sievers B (1994) A branch and bound algorithm for the job-shop-scheduling-problem. Discrete Appl Math 49:107-127
7. Carlier J (1978) Ordonnancements à contraintes disjonctives. R.A.I.R.O. Recherche opérationnelle/Oper Res 12:333-351
8. Fisher H, Thompson GL (1963) Industrial scheduling, chapter probabilistic learning combinations of local job-shop scheduling rules, pp 225-251. Prentice Hall, Englewood Cliffs
9. Glover F (1989) Tabu search - part i. ORSA J Comput 1:190-206
10. Glover F (1990) Tabu search - part ii. ORSA J Comput 2:4-32
11. Grabowski J, Pempera J (2000) Sequencing of jobs in some production system. Eur J Oper Res 125:535-550
12. Grabowski J, Wodecki M (2003) A very fast tabu search algorithm for the job shop problem with makespan criterion. Comput Oper Res (to appear)
13. 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
14. Guinet A, Legrand M (1998) Reduction of job-shop-problems to flow-shop-problems with precedence constraints. Eur J Oper Res 109:96-110
15. Hall NG, Sriskandarajah C (1996) A survey of machine scheduling-problems with blocking and no-wait in process. Oper Res 44:510-525
16. Heller J (1960) Some numerical experiments for an M× J flow shop and its decision-theoretical aspects. Oper Res 8:178-184
17. Jain A, Meeran S (1999) Deterministic job-shop-scheduling: past, present and future. Eur J Oper Res 113:390-434
18. Lawrence S (1984) Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques. Technical report, Carnegie-Mellon University, Pittsburgh
19. Lenstra JK, Rinnooy Kan AHG (1979) Computational complexity of discrete optimization problems. Ann Discrete Math 4:121-140
20. 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
21. 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
22. Mascis A, Pacciarelli D (2000) Machine scheduling via alternative graphs. Technical report, Report DIA 46-2000, Dipartimento di Informatica e Automazione, Università Roma Tre
23. Mascis A, Pacciarelli D (2002) Job shop scheduling with blocking and no-wait constraints. Eur J Oper Res 142:498-517
24. Meloni C, Pacciarelli D, Pranzo M (2002) A rollout metaheuristic for job-shop-scheduling-problems. Ann Oper Res (to appear)
25. Nowicki E, Smutnicki C (1996) A fast taboo search algorithm for the job shop scheduling problem. Manage Sci 42:797-813
26. Ovacik I, Uzsoy R (1997) Decomposition methods for complex factory scheduling-problems. Kluwer, Dordrecht
27. 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
28. Raaymakers W, Hoogeveen J (2000) Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing. Eur J Oper Res 126:131-151
29. Rajendran C (1994) A no-wait flowshop scheduling heuristic to minimize makespan. J Oper Res Soc 45:472-478
30. Reddi S, Ramamoorthy C (1973) A scheduling-problem. Oper Res Q 24:441-446
31. Reeves CR (1995) A genetic algorithm for flowshop sequencing. Comput Oper Res 22:5-13
32. Sahni S, Cho Y (1979) Complexity of scheduling shops with no-wait in process. Math Oper Res 4:448-457
33. 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
34. Schuster CJ, Framinan J (2003) Approximative procedures for no-wait job shop scheduling. Oper Res Lett 31:308-318
35. Storer RH, Wu SD, Vaccari R (1992) New search spaces for sequencing instances with application to job shop scheduling. Manage Sci 38:1495-1509
36. Wismer DA (1972) Solution of the flowshop scheduling-problem with no intermediate queues. Oper Res 20:689-697
37. Woeginger GJ (2004) Inapproximability results for no-wait job shop scheduling. Oper Res Lett 32:320-325