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

References

• Adams , J , Balas , E and Zawack , D . 1988 . The shifting bottleneck procedure for job-shop scheduling . Management Science , 34 : 391 – 401 .
   Web of Science ®Google Scholar
• Baker KR 1974 Introduction to Sequencing and Scheduling New York Wiley
   Google Scholar
• Balas , E , Lancia , G , Serafini , P and Vazacopoulos , A . 1998 . Job shop scheduling with deadlines . Journal of Combinatorial Optimization , 1 : 329 – 353 .
   Google Scholar
• Carlier , J and Pinson , E . 1989 . An algorithm for solving the job-shop problem . Management Science , 35 : 164 – 176 .
   Web of Science ®Google Scholar
• DelĺAmico , M and Trubian , M . 1993 . Applying tabu-search to the job-shop scheduling problem . Annals of Operations Research , 4 : 231 – 252 .
   Google Scholar
• Demirkol , E , Mehta , S and Uzsoy , R . 1998 . Benchmarks for shop scheduling problems . European Journal of Operational Research , 109 : 137 – 141 .
   Web of Science ®Google Scholar
• Graham , RL , Lawler , EL , Lenstra , JK and Rinnooy Kan , AHG . 1979 . Problem classification . Annals of Discrete Mathematics , 5 : 287 – 326 .
   Google Scholar
• Hodgson , TJ , Cormier , D , Weintraub , AJ and Zozom Jr , A . 1998 . Satisfying due-dates in large job-shops . Management Science , 44 : 1442 – 1446 .
   Web of Science ®Google Scholar
• Hodgson , TJ , King , RE , Thoney , K , Stanislaw , N , Weintraub , AJ and Zozom Jr , A . 2000 . On satisfying due-dates in large job-shops: idle time insertion . IIE Transactions , 32 : 177 – 180 .
   Web of Science ®Google Scholar
• Johnson , DS , Aragon , CR , Mcgeoch , LA and Schevon , C . 1989 . Optimization by simulated annealing: an experimental evaluation; Part 1, Graph partitioning . Operations Research , 37 : 865 – 892 .
   Web of Science ®Google Scholar
• Kolonko , M . 1999 . Some new results on simulated annealing applied to the job-shop scheduling problem . European Journal of Operational Research , 113 : 123 – 136 .
   Web of Science ®Google Scholar
• Matsuo H Suh CJ Sullivan RS 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
   Google Scholar
• Morton TE Pentico DW 1993 Heuristic Scheduling Systems with Applications to Production Systems and Project Management New York Wiley
   Google Scholar
• Muth JF Thompson GL 1963 Industrial Scheduling Englewood Cliffs Prentice Hall
   Google Scholar
• Nowicki , E and Smutnicki , C . 1996 . A fast taboo search algorithm for the job-shop problem . Management Science , 42 : 797 – 813 .
   Web of Science ®Google Scholar
• 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 .
   Web of Science ®Google Scholar
• Rinnooy Kan AHG 1976 Machine Scheduling Problems: Classification, Complexity and Computations The Hauge Nijhoff
   Google Scholar
• Schultz SR 2001 Scheduling problems with due-date objectives and constraints Unpublished PhD dissertation, North Carolina State University
   Google Scholar
• Van Laarhoven , PJM , Aarts , EHL and Lenstra , JK . 1992 . Job shop scheduling by simulated annealing . Operations Research , 40 : 113 – 125 .
   Web of Science ®Google Scholar
• Werner , F and Winkler , A . 1995 . Insertion techniques for the heuristic solution of the job-shop problem . Discrete Applied Mathematics , 58 : 191 – 211 .
   Web of Science ®Google Scholar