A tabu search procedure for periodic job shop scheduling

Computers and Industrial Engineering

Volumn 30, Issue 3 SPEC. ISS., 1996, Pages 433-447

  Song, Ju Seog ^a   Lee, Tae Eog ^a  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; MACHINERY; OPTIMIZATION; PROCESS CONTROL; PRODUCTION; PRODUCTIVITY;

PERIODIC JOB SHOP SCHEDULING; TABU SEARCH PROCEDURE;

SCHEDULING;

EID: 0030192702     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/0360-8352(96)00012-5     Document Type: Article

References (31)

1. K. L. Hitz. Scheduling of Flexible Flow Shops-II. Technical Report LIDS-R-1049, Laboratory for Information and Decision Systems. M.I.T., Cambridge, MA (1980).
2. H. Kamoun and C. Sriskandarajah. The Complexity of Scheduling Jobs in Repetitive Manufacturing Systems. Eur. J. Oper. Res. 70, 350-364 (1993).
3. J. K. Chaar and E. S. Davidson. Cyclic Job Shop Scheduling using Reservation Tables. Proc. 1990 IEEE Int.Conf. Robotics and Automation, Cincinnati, OH, 2128-2135 (1990).
4. N. G. Hall, H. Kamoun and C. Sriskandarajah. Scheduling in Robotics Cells: Classification, Two and Three Machine Cells. Working Paper, College of Business, The Ohio State University (1994).
5. S. B. Gershwin, R. Akella and Y. F. Choong. Short-Term Production Scheduling of an Automated Manufacturing Facility. IBM J. Res. Dev. 29, 392-400 (1985).
6. T. E. Lee and M. E. Posner. Performance Measures and Schedule Patterns in Periodic Job Shops. Opers Res. (in press)
7. R. H. Ahmadi and H. Wurgaft. Design for Synchronized Flow Manufacturing. Mgmt Sci. 40, 1469-1483 (1994).
8. C. F. G. Bispo and J. J. Sentieiro. An Extended Horizon Scheduling Algorithm for the Job-shop Problem. Proc. 1988 Int. Conf. Comp. Integrated Manufacturing, Troy, NY, 249-252 (1988).
9. S. C. Graves, H. C. Meal, D. Stefek and A. H. Zeghmi. Scheduling of Re-entrant Flow Shops. J. Opers Mgmt 3, 197-207 (1983).
10. C. Hanen. Study of a NP-hard Cyclic Scheduling Problem: The Periodic Recurrent Job Shop. Second Int. Workshop on Project Mgmt and Sched., Compiègne, France (1990).
11. H. Matsuo. Cyclic Sequencing Problems in the Two-Machine Permutation Flow shop: Complexity, Worst Case and Average Case Analysis. Manuscript. Graduate School of Business, University of Texas, Austin, Texas (1988).
12. S. T. McCormick, M. L. Pinedo, S. Shenker and B. Wolf. Sequencing in an Assembly Line with Blocking to Minimize Cycle Time. Opers Res. 37, 925-935 (1989).
13. R. Roundy. Cyclic Schedules for Job-Shops with Identical Jobs. Technical Report No. 766. School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY (1988).
14. R. J. Wittrock. Scheduling algorithms for flexible flow lines. IBM J. Res. Dev. 29, 401-412 (1985).
15. N. G. Hall, T. E. Lee and M. E. Posner. Complexity of periodic shop scheduling problems. (Submitted to Opers Res. Letts.).
16. J. Adams, E. Balas and D. Zawack. The shifting bottleneck procedure for job shop scheduling. Mgmt Sci. 34, 391-401 (1988).
17. P. Brucker, B. Jurisch and B. Sievers. A branch and bound algorithm for the job shop scheduling. Discrete Applied Mathematics 49, 107-127 (1994).
18. J. Carlier and E. Pinson. Adjustment of heads and tails for the job-shop problem. Eur. J. Oper. Res. 78, 146-161 (1994).
19. P. J. M. Van Laarhoven, E. H. L. Aarts and J. K. Lenstra. Job shop scheduling by simulated annealing. Opers Res. 40, 113-125 (1992).
20. E. Taillard. Parallel Taboo Search Techniques for the Job Shop scheduling Problem. Internal Report ORWP 89/11, Department de Mathématique, Ecole Polytechnique Fédérale de Lausanne, Lausanne (1989).
21. M. Dell'Amico and M. Trubian. Applying tabu search to job-shop scheduling problem. Annals Opers Res. 41, 231-252 (1993).
22. J. W. Barnes and J. B. Chambers. Solving the job shop scheduling problem with Tabu search. IIE Trans. 27, 257-263 (1995).
23. T. E. Lee. Periodic Job Shop Scheduling. Ph.D. Thesis, The Ohio State University (1991).
24. E. Balas. Machine sequencing via disjunctive graphs: an implicit enumeration algorithm. Opers Res. 17, 941-957 (1969).
25. F. Glover. Tabu Search - Part I. ORSA J. on Comp. 1, 190-206 (1989).
26. F. Glover. Tabu Search - Part II. ORSA J. on Comp. 2, 4-32 (1990).
27. R. M. Karp and J. B. Orlin. Parametric shortest path algorithms with an application to cyclic staffing. Discrete Applied Mathematics 3, 37-45 (1981).
28. R. Bellman. On a routing problem. Quarterly of Applied Mathematics 16, 87-90 (1958).
29. K. R. Baker. Introduction to Sequencing and Scheduling. Wiley, New York (1974).
30. E. Taillard. Benchmarks for basic scheduling problems. Eur. J. Oper. Res. 64, 278-285 (1993).
31. J. F. Muth and G. L. Thompson. Industrial Scheduling. Prentice-Hall, Englewood Cliffs, NJ (1969).