Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times

REFERENCES

• BHASKARAN , K. , and PINEDO , M. , 1991 , Dispatching . In Handbook of Industrial Engineering , G. Salvendy (ed.) ( New York ).
   Google Scholar
• BITRAN , G. R. , and GILBERT , S. M. , 1990 , Sequencing production on parallel machines with two magnitudes of sequence-dependent setup cost . Journal of Manufacturing and Operations Management , 3 , 24 – 52 .
   Google Scholar
• CARLIER , J. , 1987 , Scheduling jobs with release times and tails on identical machines to minimize the makespan . European Journal of Operational Research , 29 , 298 – 306 .
   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 PHILIPS , 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 Transactions on Semiconductor Manufacturing , 4 , 77 – 82 .
   Web of Science ®Google Scholar
• GRAHAM , R. L. , 1969 , Bounds on multiprocessor timing anomalies . SIAM Journal of Applied Mathematics , 17 , 416 – 429 .
   Web of Science ®Google Scholar
• GUSFIELD , D. , 1984 , Bounds for naive multiple machine scheduling with release times and deadlines . Journal of Algorithms , 5 , 1 – 6 .
   Web of Science ®Google Scholar
• MASUDA , T. , ISHII , H. , and NISHIDA , T. , 1983 , Some bounds on approximation algorithms for n/m/1/Lmax and n/2/F/Lmax scheduling problems . Journal of Operations Research Society of Japan , 28 , 212 – 224 .
   Google Scholar
• MONMA , C. , and POTTS , C. N. , 1993 , Analysis of heuristic for preemptive parallel machine scheduling with batch setup times . Operations Research , 41 , 981 – 993 .
   Web of Science ®Google Scholar
• MORTON , T. E. , 1981 , Forward, Algorithms for Forward-Thinking Managers . In Applications of Management Science , R. L. Schulz (ed.) Greenwich , 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.,UZSOY. R., 1993 , Worst-case error bounds for parallel machine scheduling problems with bounded sequence-dependent setup times . Operations Research Letters , 14 , 251 – 256 .
   Web of Science ®Google Scholar
• OVACIK , I. M. , and UZSOY , R. , 1994 a, Exploiting shop floor status information to schedule complex job shops . Journal of Manufacturing Systems , 13 , 73 – 84 .
   Web of Science ®Google Scholar
• OVACIK , I. M. , and UZSOY , R. , 1994 b, Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times . International Journal of Production Research , 32 , 1243 – 1263 .
   Web of Science ®Google Scholar
• OVACIK, 1. M, and UZSOY , R. , 1994 c, Decomposition methods for scheduling complex job shops an application to semiconductor testing facilities . Research report , School of Industrial Engineering, Purdue University , West Lafayette , Indiana .
   Google Scholar
• PARKER , R. G. , DEANE , R. H. , HOLMES , R. A. , 1977 , On the use of a vehicle routing algorithm for the parallel processor problem with sequence dependent change over costs . AIIE Transactions , 9 , 155 – 160 .
   Google Scholar
• PINEDO , M. , 1995 , Scheduling Theory, Algorithms and Systems , ( New Jersey Prentice-Hall ).
   Google Scholar
• So, K. C, 1990 . Some heuristics for scheduling jobs on parallel machines with set-ups . Management Science , 36 , 467 – 475 .
   Web of Science ®Google Scholar
• TANG, C. S.,; 1990 , Scheduling batches on parallel machines with major and minor set-ups . European Journal of Operations Research , 46 , 28 – 37 .
   Web of Science ®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