Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times

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
• BALAS , E. , and TOTH , P. , 1985 , Branch and bound methods. In The Traveling Salesman Problem A Guided Tour of Combinatorial Optimization , E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan and D. B. Shmoys (eds) ( New York Wiley ).
   Google Scholar
• BAKER , K. R. , 1974 , Introduction to Sequencing and Scheduling ( New York Wiley ).
   Google Scholar
• BAKER , K. R. , and Su , Z. S. , 1974 , Sequencing with due dates and early start times to minimize maximum tardiness . Naval Research Logistics Quarterly , 21 , 171 – 176 .
   Google Scholar
• BHASKARAN , K. , and PINEDO , M. , 1991 , Dispatching. In Handbook of Industrial Engineering , G. Salvendy (ed.) ( New York Wiley ).
   Google Scholar
• CARLIER , J. , 1982 , The one-machine scheduling problem . European Journal of Operational Research , 11 , 42 – 47 .
   Web of Science ®Google Scholar
• CONSILIUM INC. , 1988 , Short Interval Scheduling System Users Manual- Internal Publication ( Mountain View , CA ).
   Google Scholar
• FOWLER , J. W. , HOGG , G. L. , and PHILLIPS , D. T. , 1992 , Control of multiproduct bulk service diffusion/oxidation processes . IIE Transactions on Scheduling and Logistics , 24 , 84 – 96 .
   Web of Science ®Google Scholar
• GAREY , M. R. , and JOHNSON , D. S. , 1979 , Computers and Intractability A Guide to the Theory of NP Completeness ( San Francisco W. H. Freeman ).
   Google Scholar
• GLASSEY , C. R. , and WENG , W. W. , 1991 , Dynamic batching heuristic for simultaneous processing . IEEE Transaction on Semiconductor Manufacturing , 4 , 77 – 82 .
   Web of Science ®Google Scholar
• HALL , L. , and SHMOYS , D. , 1992 , Jackson's rule for one-machine scheduling making a good heuristic better . Mathematics of Operations Research , 17 , 22 – 35 .
   Web of Science ®Google Scholar
• LAGEWEG , B. J. , LAWLER , E. L. , LENSTRA , J. K. , RINNOOY KAN , A. H. G. , 1981 , Computer aided complexity classification of deterministic scheduling problems , Research Report BW 138/81 ( Amsterdam Mathematisch Centrum ).
   Google Scholar
• LAGEWEG , B. J. , LENSTRA , J. K. , RINNOOY KAN , A. H. G. , 1976 , Minimizing maximum lateness on one machine computational experience and some applications . Statistica Neerlandica , 30 , 25 – 41 .
   Google Scholar
• LAWLER , E. L. , 1973 , Optimal sequencing of a single machine subject to precedence constraints . Management Science , 19 , 544 – 546 .
   Web of Science ®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
• MONMA , C. , and POTTS , C. N. , 1989 , On the complexity of scheduling with batch setup times . Operations Research , 37 , 798 – 804 .
   Web of Science ®Google Scholar
• MORTON , T. E. , Forward algorithms for forward-thinking managers . In Applications of Management Science , R. L. Schulz (ed.) (| cyGreenwich|cy, CT JAI Press ), pp. 1 – 55 .
   Google Scholar
• OVACIK , I. M. , and UZSOY , R. , 1992 , A shifting bottleneck algorithm for scheduling semiconductor testing operations . Journal of Electronics Manufacturing , 2 , 119 – 134 .
   Google Scholar
• OVACIK , I. M. , and UZSOY , R. , 1993 , Exploiting shop floor status information to schedule complex job shops . Journal of Manufacturing Systems , forthcoming .
   Web of Science ®Google Scholar
• PARKER , R. G. , and RARDIN , R. L. , 1988 , Discrete Optimization ( San Diego Academic ).
   Google Scholar
• PICARD , J. C. , and QUEYRANNE , M. , 1978 , The time-dependent travelling salesman problem and its application to the tardiness problem in one-machine scheduling . Operations Research , 26 , 86 – 110 .
   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
• SAHNI , S. , and GONZALEZ , T. , 1976 , P-complete approximation problems . Journal of the Association for Computing Machinery , 23 , 555 – 565 .
   Web of Science ®Google Scholar
• UNAL , A. T. , and KIRAN , A. S. , 1992 , Batch sequencing . IIE Transactions on Scheduling and Logistics , 24 , 73 – 83 .
   Web of Science ®Google Scholar
• UZSOY , R. , 1993 , Decomposition methods for scheduling complex dynamic job shops . Proceedings of the NSF Grantees' Conference , Charlotte , NC , pp. 1253 – 1257 .
   Google Scholar
• UZSOY , R. , CHURCH , L. K. , OVACIK , I. M. , and HINCHMAN , J. , 1993 , Performance evaluation of dispatching rules for semiconductor testing operations . Journal of Electronics Manufacturing , 3 , 95 – 105 .
   Google Scholar
• UZSOY , R. , LEE , C. Y. , and MARTIN-VEGA , L. A. , 1992 , Scheduling semiconductor test operations minimizing maximum lateness and number of tardy jobs on a single machine . Naval Research Logistics , 39 , 369 – 388 .
   Web of Science ®Google Scholar
• UZSOY , R. , MARTIN-VEGA , L. A. , LEE , C. Y. , and LEONARD , P. A. , 1991 , Production scheduling algorithms for a semiconductor tesing facility . IEEE Transactions on Semiconductor Manufacturing , 4 , 270 – 280 .
   Web of Science ®Google Scholar
• ZDRZALKA , S. , 1992 , Preemptive scheduling with release dates, delivery times and sequence independent setup times. Institute of Engineering Cybernetics , Technical University of Wroclaw , Wroclaw , Poland .
   Google Scholar