An enhanced timetabling procedure for the no-wait job shop problem: A complete local search approach

Computers and Operations Research

Volumn 33, Issue 5, 2006, Pages 1200-1213

  Framinan, Jose M ^a,c   Schuster, Christoph ^b  

^a UNIVERSITY OF SEVILLE   (Spain)

^b BAYER AG   (Germany)

^c UNIVERSIDAD DE SEVILLA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EMBEDDED SYSTEMS; HEURISTIC METHODS; PROBLEM SOLVING;

METAHEURISTICS; NO-WAIT JOB SHOP PROBLEM; TIMETABLING PROBLEM;

SEARCH ENGINES;

EID: 26444615351     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2004.09.009     Document Type: Article

References (28)

1. D.A. Wismer Solution of the flowshop scheduling-problem with no intermediate queues Operations Research 20 1972 689 697
2. S. Reddi, and C. Ramamoorthy A scheduling-problem Operational Research Quarterly 24 1973 441 446
3. N.G. Hall, and C. Sriskandarajah A survey of machine scheduling-problems with blocking and no-wait in process Operations Research 44 3 1996 510 525
4. C. Rajendran A no-wait flowshop scheduling heuristic to minimize makespan Journal of the Operational Research Society 45 4 1994 472 478
5. J. Grabowski, and J. Pempera Sequencing of jobs in some production system European Journal of Operational Research 125 2000 535 550
6. I. Ovacik, and R. Uzsoy Decomposition Methods for Complex Factory Scheduling-Problems 1997 Kluwer Academic Publishing Dordecht
7. J.K. Lenstra, and A.H.G. Rinnooy Kan Computational complexity of discrete optimization problems Annals of Discrete Mathematics 4 1979 121 140
8. J. Blazewicz, W. Domschke, and E. Pesch The job-shop-scheduling-problem conventional and new solution techniques European Journal of Operational Research 93 1996 1 33
9. A. Jain, and S. Meeran Deterministic job-shop-scheduling past, present and future European Journal of Operational Research 113 2 1999 390 434
10. P. Brucker, B. Jurisch, and B. Sievers A branch and bound algorithm for the job-shop-scheduling-problem Discrete Applied Mathematics 49 1994 107 127
11. Martin P, Shmoys DB. A New Approach to Computing Optimal Schedules for the Job-Shop-Scheduling-Problem. In: IPCO'96, Vancouver, British Columbia, Canada, 1996. p. 389-403.
12. Caseau Y, Laburthe F. Improving branch and bound for jobshop scheduling with constraint propagation. In: Franco-Japanese and (n-4th) Franco-Chinese Conference Combinatorics and Computer Sciences, Lecture notes in Computer Science, vol. 8, 1995.
13. E. Balas, and A. Vazacopoulos Guided local search with shifting bottleneck for job-shop-scheduling Management Science 44 2 1998 262 275
14. E. Nowicki, and C. Smutnicki A fast taboo search algorithm for the job shop scheduling problem Management Science 42 6 1996 797 813
15. S. Sahni, and Y. Cho Complexity of scheduling shops with no-wait in process Mathematics of Operations Research 4 1979 448 457
16. A. Mascis, and D. Pacciarelli Job shop scheduling with blocking and no-wait constraints European Journal of Operational Research 142 3 2002 498 517
17. Mascis A, Pacciarelli D. Machine scheduling via alternative graphs. Technical report, Report DIA 46-2000, Dipartimento di Informatica e Automazione, Università Roma Tre, 2000.
18. R. Macchiaroli, S. Mole, and S. Riemma Modelling and optimization of industrial manufacturing processes subject to no-wait constraints International Journal of Production Research 37 11 1999 2585 2607
19. W. Raaymakers, and J. Hoogeveen Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing European Journal of Operational Research 126 2000 131 151
20. C. Schuster, and J.M. Framinan Approximative procedures for no-wait job shop scheduling Operations Research Letters 31 2003 308 318
21. L. Wang, and D. Zheng An effective hybrid optimization strategy for job-shop scheduling problems Computers & Operations Research 28 2001 585 596
22. D. Ghosh, and G. Sierksma Complete local search with memory Journal of Heuristics 8 2002 571 584
23. Schuster C. No-wait job shop scheduling: Komplexität und local search Dissertation Thesis, University of Duisburg-Essen, Germany, 2003 [in German].
24. F. Glover Tabu search - part II ORSA Journal on Computing 2 1990 4 32
25. H. Fisher, and G.L. Thompson Probabilistic learning combinations of local job-shop scheduling rules Industrial scheduling 1963 Prentice-Hall Englewood Cliffs, NJ 225 251
26. Lawrence S. Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques. Technical report, Carnegie-Mellon University, Pittsburgh, 1984.
27. D. Applegate, and W. Cook A computational study of the job-shop problem ORSA Journal on Computing 3 2 1991 149 156
28. R.H. Storer, S.D. Wu, and R. Vaccari New search spaces for sequencing instances with application to job shop scheduling Management Science 38 1992 1495 1509