Minimizing Lmax for large-scale, job-shop scheduling problems

International Journal of Production Research

Volumn 42, Issue 23, 2004, Pages 4893-4907

  Schultz, S R ^a   Hodgson, T J ^b   King, R E ^b   Thoney, K A ^c  

^a MERCER UNIVERSITY   (United States)

^b North Carolina State University   (United States)

^c NORTH CAROLINA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE SYSTEMS; ALGORITHMS; BENCHMARKING; COMPUTER SIMULATION; ITERATIVE METHODS; JOB ANALYSIS; PROBLEM SOLVING; SIMULATED ANNEALING;

DOWNSTREAM OPERATIONS; JOB-SHOP SCHEDULING PROBLEMS; LARGE-SCALE PROBLEMS; VIRTUAL FACTORY;

SCHEDULING;

EID: 9944222039     PISSN: 00207543     EISSN: None     Source Type: Journal    
DOI: 10.1080/00207540410001721754     Document Type: Article

References (20)

1. ADAMS, J., BALAS, E. and ZAWACK, D., 1988, The shifting bottleneck procedure for job-shop scheduling. Management Science, 34, 391-401.
2. BAKER, K. R., 1974, Introduction to Sequencing and Scheduling (New York: Wiley).
3. BALAS, E., LANCIA, G., SERAFINI, P. and VAZACOPOULOS, A., 1998, Job shop scheduling with deadlines. Journal of Combinatorial Optimization, 1, 329-353.
4. CARLIER, J. and PINSON, E., 1989, An algorithm for solving the job-shop problem. Management Science, 35, 164-176.
5. DELL AMICO, M. and TRUBIAN, M., 1993, Applying tabu-search to the job-shop scheduling problem. Annals of Operations Research, 4, 231-252.
6. DEMIRKOL, E., MEHTA, S. and UZSOY, R., 1998, Benchmarks for shop scheduling problems. European Journal of Operational Research, 109, 137-141.
7. GRAHAM, R. L., LAWLER, E. L., LENSTRA, J. K. and RINNOOY KAN, A. H. G., 1979, Problem classification. Annals of Discrete Mathematics, 5, 287-326.
8. HODGSON, T. J., CORMIER, D., WEINTRAUB, A. J. and ZOZOM, JR, A., 1998, Satisfying due-dates in large job-shops. Management Science, 44, 1442-1446.
9. HODGSON, T. J., KING, R. E., THONEY, K., STANISLAW, N., WEINTRAUB, A. J. and ZOZOM, JR, A., 2000, On satisfying due-dates in large job-shops: idle time insertion. IIE Transactions, 32, 177-180.
10. JOHNSON, D. S., ARAGON, C. R., MCGEOCH, L. A. and SCHEVON, C., 1989, Optimization by simulated annealing: an experimental evaluation; Part 1, Graph partitioning. Operations Research, 37, 865-892.
11. KOLONKO, M., 1999, Some new results on simulated annealing applied to the job-shop scheduling problem. European Journal of Operational Research, 113, 123-136.
12. MATSUO, H., SUH, C. J. and SULLIVAN, R. S., 1998, A Controlled Search Simulated Annealing Method for the General Job Shop Scheduling Problem. Working Paper 03-04088 (Austin: Department of Management, University of Texas).
13. MORTON, T. E. and PENTICO, D. W., 1993, Heuristic Scheduling Systems with Applications to Production Systems and Project Management (New York: Wiley).
14. MUTH, J. F. and THOMPSON, G. L., 1963. Industrial Scheduling (Englewood Cliffs: Prentice Hall).
15. NOWICKI, E. and SMUTNICKI, C., 1996, A fast taboo search algorithm for the job-shop problem. Management Science, 42, 797-813.
16. PEZZELLA, F. and MERELLI, E., 2000, A tabu search method guided by shifting bottleneck for the job-shop scheduling problem. European Journal of Operational Research, 120, 297-310.
17. RINNOOY KAN, A. H. G., 1976, Machine Scheduling Problems: Classification, Complexity and Computations (The Hauge: Nijhoff).
18. SCHULTZ, S. R., 2001, Scheduling problems with due-date objectives and constraints. Unpublished PhD dissertation, North Carolina State University.
19. VAN LAARHOVEN, P. J. M., AARTS, E. H. L. and LENSTRA, J. K., 1992, Job shop scheduling by simulated annealing. Operations Research, 40, 113-125.
20. WERNER, F. and WINKLER, A., 1995, Insertion techniques for the heuristic solution of the job-shop problem. Discrete Applied Mathematics, 58, 191-211.