Minimizing total tardiness on a batch processing machine with incompatible job families

References

• Uzsoy , R. , Lee , C.-Y. and Martin-Vega , L.A. , ( 1992 ) A review of production planning and scheduling models in the semiconductor industry. Part I system characteristics, performance evaluation and production planning . IIE Transactions on Scheduling and Logistics , 24 , 47 – 59 .
   Web of Science ®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
• Runyan , W.R. and Bean , K.E. , ( 1990 ) Semiconductor IntegratedCircuit Processing Technology , Addison-Wesley , New York .
   Google Scholar
• Uzsoy , R. , ( 1995 ) Scheduling batch processing machines with incompatible job families . International Journal of Production Research , 33 , 2685 – 2708 .
   Web of Science ®Google Scholar
• Du , J. and Leung , J.Y.T. , ( 1990 ) Minimizing total tardiness on one machine is NP-hard . Mathematics of Operations Research , 15 , 483 – 95 .
   Web of Science ®Google Scholar
• Lawler , E.L. , ( 1977 ) A pseudopolynomial algorithm for sequencing jobs to minimize total tardiness . Annals of Discrete Mathematics , 1 , 331 – 342 .
   Google Scholar
• Potts , C.N. , Van Wassenhove , L.N. , ( 1982 ) A decomposition algorithm for the single machine total tardiness problem . Operations Research Letters , 1 , 177 – 181 .
   Google Scholar
• Vepsalainen , A. and Morton , T.E. , ( 1987 ) Priority rules and lead time estimation for job shop scheduling with weighted tardiness costs . Management Science , 33 , 1036 – 1047 .
   Web of Science ®Google Scholar
• Chambers , R.J. , Carraway , R.L. , Lowe , T.J. and Morin , T.L. , ( 1991 ) Dominance and decomposition heuristics for single machine scheduling . Operations Research , 39 , 639 – 647 .
   Web of Science ®Google Scholar
• Abdul-Razaq , T.S. , Potts , C.N. , van Wassenhove , L.N. , ( 1990 ) A survey of algorithms for the single machine weighted tardiness problem . Discrete Applied Mathematics , 26 , 235 – 253 .
   Web of Science ®Google Scholar
• Pinedo , M. , ( 1995 ) Scheduling Theory, Algorithms and Systems , Prentice Hall , NJ .
   Google Scholar
• Webster , S. and Baker , K.R. , ( 1995 ) Scheduling groups of jobs on a single machine . Operations Research , 43 , 692 – 703 .
   Web of Science ®Google Scholar
• Ikura , Y. and Gimple , M. , ( 1986 ) Scheduling algorithms for a single batch processing machine . Operations Research Letters , 5 , 61 – 65 .
   Web of Science ®Google Scholar
• Ue , C.Y. , Uzsoy , R. and Martin-Vega , L.A. , ( 1992 ) Efficient algorithms for scheduling batch processing machines . Operations Research , 40 , 764 – 775 .
   Web of Science ®Google Scholar
• Li , C.-L. and Le , C.-Y. , ( 1997 ) Scheduling with agreeable release times and due dates on a batch processing machine . European Journal of Operational Research , (forthcoming) .
   Web of Science ®Google Scholar
• Ahmadi , J.H. , Ahmadi , R.H. , Dasu , S. and Tang , C.S. , ( 1992 ) Batching and scheduling jobs on batch and discrete processors , Operations Research , 40 , 750 – 763 .
   Web of Science ®Google Scholar
• Chandru , V. , Lee , C.Y. and Uzsoy , R. , ( 1993 ) Minimizing total completion time on batch processing machines . International Journal of Production Research , 31 , 2097 – 2121 .
   Web of Science ®Google Scholar
• Chandru , V. , Lee , C.Y. and Uzsoy , R. , ( 1993 ) Minimizing total completion time on a batch processing machine with job families . Operations Research Letters , 13 , 61 – 65 .
   Web of Science ®Google Scholar
• Hochbaum , D.S. and Landy , D. , ( 1994 ) Algorithms and heuristics for scheduling semiconductor burn-in operations ; Research Report ESRC 94–8, Department of Industrial Engineering and Operations Research , University-of California , Berkeley , CA 94720 .
   Google Scholar
• Uzsoy , R. , ( 1994 ) Scheduling a single batch processing machine with nonidentical job sizes . International Journal of Production Research , 32 , 1615 – 1635 .
   Web of Science ®Google Scholar
• Uzsoy , R. , Lee , C.Y. and Martin-Vega , L.A. , ( 1994 ) A survey of production planning and scheduling models in the semiconductor industry. Part II shop-floor control . IIE Transactions on Scheduling and Logistics , 26 , 44 – 45 .
   Web of Science ®Google Scholar
• Uzsoy , R. and Yang , Y. , ( 1997 ) Minimizing total weighted completion time on a single batch processing machine . Production and Operations Management , 6 , 57 – 73 .
   Google Scholar
• Lee , C.Y. and Uzsoy , R. , ( 1996 ) Minimizing makespan on a single batch processing machine with dynamic job arrivals . School of Industrial Engineering , Purdue University , West Lafayette , IN .
   Google Scholar
• Dobson , G. and Nabinadom , R.S. , ( 1992 ) The batch loading and scheduling problem . Research Report, Simon Graduate School of Business Administration , University of Rochester .
   Google Scholar
• Chandra , P. and Gupta , S. , ( 1992 ) An analysis of a last-station-bottleneck semiconductor packaging line . Research Report, Faculty of Management , McGill University .
   Google Scholar
• Lenstra , J.K. , Rinnooy Kan , A.H.G. and Brucker , P. , ( 1977 ) Complexity of machine scheduling problems . Annals of Discrete Mathematics , 1 , 343 – 362 .
   Google Scholar
• Monma , C.L. and Potts , C.N. , ( 1989 ) On the complexity of scheduling with batch setup times . Operations Research , 37 , 798 – 804 .
   Web of Science ®Google Scholar
• Ashour , S. , ( 1967 ) A decomposition approach for the machine scheduling problem . International Journal of Production Research , 6 , 109 – 122 .
   Google Scholar
• Sidney , J.B. , ( 1975 ) Decomposition algorithms for single machine sequencing with precedence relations and deferral costs . Operations Research , 23 , 283 – 298 .
   Web of Science ®Google Scholar
• Sidney , J.B. , ( 1981 ) A decomposition algorithm for sequencing with general precedence constraints . Mathematics of Operations Research , 6 , 190 – 204 .
   Web of Science ®Google Scholar
• Ovacik , I. and Uzsoy , R. , ( 1994 ) 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