A new neighborhood and tabu search for the Blocking Job Shop

Discrete Applied Mathematics

Volumn 157, Issue 17, 2009, Pages 3643-3655

  Gröflin, Heinz ^a   Klinkert, Andreas ^b  

^a UNIVERSITY OF FRIBOURG   (Switzerland)

^b ZURICH UNIVERSITY OF APPLIED SCIENCES   (Switzerland)

Author keywords

Blocking; Disjunctive graph; Job shop scheduling; Setup; Tabu search

Indexed keywords

BLOCKING; DISJUNCTIVE GRAPH; INTERMEDIATE BUFFERS; JOB SHOP; JOB SHOP SCHEDULING; JOB SHOP SCHEDULING PROBLEMS; LOCAL SEARCH; SEQUENCE-DEPENDENT SETUP TIME; SETUP; SHORT CYCLE; TABU SEARCH ALGORITHMS;

LEARNING ALGORITHMS;

TABU SEARCH;

EID: 70350069044     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2009.02.020     Document Type: Article

References (30)

1. Adams J., Balas E., and Zawack D. The shifting bottleneck procedure for job shop scheduling. Management Science 34 3 (1988) 391-401
2. Applegate D., and Cook W. A computational study of the job shop scheduling problem. ORSA Journal on Computing 3 2 (1991) 149-156
3. Brizuela C.A., Zhao Y., and Sannomiya N. No-wait and blocking job-shops: Challenging problems for GA's. IEEE 0-7803-77-2/ 01 (2001) 2349-2354
4. Brucker P., and Kampmeyer T. Cyclic job shop scheduling problems with blocking. Annals of Operations Research 159 (2008) 161-181
5. O. Candar, Machine scheduling problems with blocking and no-wait in process, Working Paper [April-99], Department of Industrial Engineering, Bilkent University, Ankara, Turkey, 1999
6. Chen L., Bostel N., Dejax P., Cai J., and Xi L. A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal. European Journal of Operational Research 181 (2007) 40-58
7. D'Ariano A., Pacciarelli D., and Pranzo M. A branch and bound algorithm for scheduling trains in a railway network. European Journal of Operational Research 183 (2007) 643-657
8. Glover F., and Laguna M. Tabu Search (1997), Kluwer, Boston
9. Grabowski J., and Pempera J. Sequencing of jobs in some production system. European Journal of Operational Research 125 (2000) 535-550
10. H. Gröflin, A. Klinkert, Local search in job shop scheduling with synchronization and blocking constraints, Internal working paper [04-06], Department of Informatics, University of Fribourg, Switzerland, 2004
11. Gröflin H., and Klinkert A. Feasible insertions in job shop scheduling short cycles and stable sets. European Journal of Operational Research 177 (2007) 763-785
12. Hall N.G., and Sriskandarajah C. A survey of machine scheduling problems with blocking and no-wait in process. Operations Research 44 3 (1996) 510-525
13. S. Heitmann, Job-shop scheduling with limited buffer capacities, Doctoral Thesis, University of Osnabrück, Germany, 2007
14. Jain A.S., and Meeran S. Deterministic job-shop scheduling: Past present and future. European Journal of Operational Research 113 (1999) 390-434
15. A. Klinkert, Optimization in design and control of automated high-density warehouses, Doctoral Thesis No. 1353, University of Fribourg, Switzerland, 2001
16. S. Lawrence, Supplement to Resource Constrained Project Scheduling: An Experimental Investigation of Heuristic Scheduling Techniques, GSIA, Carnegie Mellon University, Pittsburgh, PA, 1984
17. A. Mascis, D. Pacciarelli, Machine scheduling via alternative graphs, Research Report, RT-DIA-46-2000, Italy, 2000
18. Mascis A., and Pacciarelli D. Job-shop scheduling with blocking and no-wait constraints. European Journal of Operational Research 143 (2002) 498-517
19. Mati Y., Rezg N., and Xie X. Geometric approach and taboo search for scheduling flexible manufacturing systems. IEEE Transactions on Robotics and Automation 17 6 (2001) 805-818
20. Y. Mati, N. Rezg, X. Xie, Scheduling problem of job-shop with blocking: A taboo search approach, Extended Abstracts, MIC 2001-4th Metaheuristics International Conference, Portugal, 2001, pp. 643-648
21. Meloni C., Pacciarelli D., and Pranzo M. A rollout metaheuristic for job shop scheduling problems. Annals of Operations Research 131 (2004) 215-235
22. In: Muth J.F., and Thompson G.L. (Eds). Industrial Scheduling (1963), Kluwer, Dordrecht
23. Nowicki E., and Smutnicki C. A fast taboo search algorithm for the job shop problem. Management Science 42 6 (1996) 797-812
24. Pacciarelli D. Alternative graph formulation for solving complex factory-scheduling problems. International Journal of Production Research 40 15 (2002) 3641-3653
25. Pacciarelli D., and Pranzo M. Production scheduling in a steelmaking-continuous casting plant. Computers and Chemical Engineering 28 (2004) 2823-2835
26. Pinedo M., and Chao X. Operations Scheduling with Applications in Manufacturing and Services (1999), Irwin/McGraw-Hill, Boston
27. Romero J., Puigjaner L., Holczinger T., and Friedler F. Scheduling intermediate storage multipurpose batch plants using the s-graph. AIChE Journal 50 (2004) 403-417
28. B. Roy, B. Sussman, Les problèmes d'ordonnancement avec contraintes disjonctives, Note DS No. 9 bsi, SEMA, Paris, France, 1964
29. Storer R.H., Wu S.D., and Vaccari R. New search spaces for sequencing problems with application to job shop scheduling. Management Science 38 10 (1992) 1495-1509
30. T. Yamada, R. Nakano, A genetic algorithm applicable to large-scale job-shop problems, in: Proceedings of the 2nd Parallel Problem Solving from Nature, PPSN '92, 1992, pp. 281-290