A modified shifting bottleneck procedure for job-shop scheduling

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
• CARLIER , J. , 1982 , The one-machine sequencing problem . European Journal of Operational Research , 11 , 42 – 47 .
   Web of Science ®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
• DAUZERE-PERES , S. , and LASSERRE , J.-B. , 1990 , A modified shifting bottleneck procedure for job shop scheduling . Rapport LAAS n° 90106, April 1990 .
   Google Scholar
• FISHER , H. , and THOMPSON , G. L. , 1963 , Probabilistic learning combinations of local job-shop scheduling rules . Industrial Scheduling , edited by J. F. Muth and G. L. Thompson ( Englewood Cliffs , NJ Prentice-Hall ), pp. 225 – 251 .
   Google Scholar
• LAGEWEG , B. J. , LENSTRA , J. K. ,RINNOOY KAN , A. H. G. , 1977 , Job-shop scheduling by implicit enumeration . Management Science , 24 , 441 – 450 .
   Web of Science ®Google Scholar
• LAWLER , E. L. , LENSTRA , J. K. , RINNOOY KAN , A. H. G. and SHMOYS , D. B. , 1989 , Sequencing and scheduling algorithms and complexity , Report BS-R8909 , Centre for Mathematics and Computer Science , Amsterdam .
   Google Scholar
• MCMAHON , G. , and FLORIAN , M. , 1975 , On scheduling with ready times and due dates to minimize maximum lateness . Operations Research , 23 , 475 – 482 .
   Web of Science ®Google Scholar
• POTTS , C. N. , 1980 , Analysis of a heuristic for one machine sequencing with release dates and delivery times . Operations Research , 28 , 1436 – 1441 .
   Web of Science ®Google Scholar
• ROY , B. , and SUSSMAN , B. , 1964 , Les Problemes d'Ordonnancement avec Contraintes Disjonctives , Note DS n° 9 bis , SEMA , Montrouge .
   Google Scholar