Reactive scheduling of a semiconductor testing facility
暂无分享,去创建一个
[1] David S. Johnson,et al. Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .
[2] Reha Uzsoy,et al. A shifting bottleneck algorithm for scheduling semiconductor testing operations , 1992 .
[3] Reha Uzsoy,et al. Minimizing total completion time on batch processing machines , 1993 .
[4] Reha Uzsoy,et al. Dispatching Rules For Semiconductor Testing Operations: A Computational Study , 1992, Thirteenth IEEE/CHMT International Electronics Manufacturing Technology Symposium.
[5] Reha Uzsoy,et al. A review of production planning and scheduling models in the semiconductor industry , 1994 .
[6] Reha Uzsoy,et al. A REVIEW OF PRODUCTION PLANNING AND SCHEDULING MODELS IN THE SEMICONDUCTOR INDUSTRY PART I: SYSTEM CHARACTERISTICS, PERFORMANCE EVALUATION AND PRODUCTION PLANNING , 1992 .
[7] Egon Balas,et al. The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .
[8] Jeff Cox,et al. The Goal: A Process of Ongoing Improvement , 1984 .
[9] Reha Uzsoy,et al. Scheduling semiconductor test operations: Minimizing maximum lateness and number of tardy jobs on a single machine , 1992 .