A fast hybrid tabu search algorithm for the no-wait job shop problem

Computers and Industrial Engineering

Volumn 56, Issue 4, 2009, Pages 1502-1509

  Bozejko, Wojciech ^a   Makuchowski, Mariusz ^a  

^a WROCLAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Hybrid algorithm; Job shop problem; No wait constraint; Tabu search

Indexed keywords

ALGORITHM COMPLEXITY; COMPARATIVE ANALYSIS; HYBRID ALGORITHM; HYBRID TABU SEARCHES; JOB SHOP PROBLEM; MAKESPAN CRITERIONS; NO-WAIT CONSTRAINT; NO-WAIT JOB SHOP PROBLEMS; NUMERICAL RESEARCHES; OPTIMAL SOLUTIONS; TABU SEARCH TECHNIQUES;

CIRCUIT THEORY; COMPUTATIONAL COMPLEXITY; LEARNING ALGORITHMS;

TABU SEARCH;

EID: 67349160995     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2008.09.023     Document Type: Article

References (13)

1. Framinan J., and Schuster C. An enhanced timetabling procedure for the no-wait job shop problem: A complete local search approach. Computers and Operations Research 33 5 (2006) 1200-1213
2. Glover F. Tabu search - part I. ORSA Journal on Computing 1 (1989) 190-206
3. Glover F. Tabu search - part II. ORSA Journal on Computing 2 (1990) 4-32
4. Graham R., Lawler E., Lenstra J., and Rinnooy Kan A. Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics 5 (1979) 287-326
5. Hall N., and Sriskandarajah C. A survey of machine scheduling-problems with blocking and no-wait in process. Operations Research 44 3 (1996) 510-525
6. Lenstra J., and Rinnooy Kan A. Computational complexity of discrete optimization problems. Annals of Discrete Mathematics 4 (1979) 121-140
7. Macchiaroli R., Mole S., and Riemma S. Modelling and optimization of industrial manufacturing processes subject to no-wait constrains. International Journal of Production Research 37 11 (1999) 2585-2607
8. Mascis A., and Pacciarelli D. Job shop scheduling with blocking and no-wait constraints. European Journal of Operational Research 142 3 (2002) 498-517
9. Nawaz M., Enscore Jr. E.E., and Ham I. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. OMEGA International Journal of Management Science 11 (1983) 91-95
10. Raaymakers W., and Hoogeveen J. Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing. European Journal of Operational Research 126 (2000) 131-151
11. Schuster C. No-wait job shop scheduling: Tabu search and complexity of subproblems. Mathematical Methods of Operations Research 63 3 (2006) 473-491
12. Schuster C., and Framinan J. Approximative procedures for no-wait job shop scheduling. Operations Research Letters 31 (2003) 308-318
13. Wismer D.A. Solution of the flowshop scheduling-problem with no intermediate queues. Operations Research 20 (1972) 689-697