References
- Albcrs , S. and Bruckcr , P. ( 1993 ) The complexity of one-machine batching problems . Discrete Applied Malhemulics , 47 , 87 – 107 .
- Bruckcr , P. , Gladky , A. , Hoogevcen , H. , Kovalyov , M.Y. , Potts, C, Tnnlcnhuhn , T. and Van de Veldc , S. ( 1998 ) Scheduling a batching machine . Journal of Scheduling , 1 , 31 – 54 .
- Bruckcr , P. and Kovalyov , M.Y. ( 1996 ) Single machine batch scheduling to minimize the weighted number of late jobs . Mathematical Methods of Operations Research , 43 , 1 – 8 .
- Chandru , V. , Lcc , C.-Y. and Uzsoy , R. ( 1993A ) Minimizing total completion time on batch processing machines . International Journal of Production Research , 31 , 2097 – 2122 .
- Chandru , V. , Lcc , C.-Y. and Uzsoy , R. ( 1993B ) Minimizing total completion time on a batch processing machine . Operations Research Letters , 13 , 61 – 65 .
- Cheng , T.C.E. and Kovalyov , M.Y. ( 1995 ) Single machine batch scheduling with deadlines and resource dependent processing times . Operations Research Letters , 17 , 243 – 249 .
- Cheng , T.C.E. , Chen , Z.-L. , Kovalyov , M.Y. and Lin , B.M.T. ( 1996 ) Parallel-machine batching and scheduling to minimize total completion time . HE Transactions , 28 , 953 – 956 .
- Cheng , T.C.E. , Gordon , V.S. and Kovalyov , M.Y. ( 1996 ) Single machine scheduling with batch deliveries . European Journal of Operations Research , 94 , 277 – 283 .
- Cheng , T.C.E. , Kovalyov , M.Y. and Lin , B.M.T. ( 1997 ) Single machine scheduling to minimize batch delivery and job earliness penalties . SIAM Journal on Optimization , 7 , 547 – 559 .
- Coffman , E.G. , Nozari , A. and Yannakakis , M. ( 1989 ) Optimal scheduling of products with two subassemblies on a single machine . Operations Research , 37 , 426 – 436 .
- Coffman , E.G. Jr. , Yannakakis , M. , Magazine , M.J. and Santos , C. ( 1990 ) Batch sizing and job sequencing on a single machine . Annals of Operations Research , 26 , 135 – 147 .
- Hochbaum . D.S. and Landy , D. ( 1994a ) Scheduling semiconductor burn-in operations to minimize total flowtime . Operations Research , 45 , 874 – 885 .
- Hochbaum , D.S. and Landy , D. ( 1994b ) Scheduling with batching minimizing the weighted number of tardy jobs . Operations Research Letters , 16 , 79 – 86 .
- Karp , R.M. ( 1972 ) Reducibility among combinatorial problems, in Complexity of Computer Computations , Miller, R.E. and Thatcher, J.W. (eds) . Plenum Press , New York , pp. 85 – 104 .
- Lee , C.-Y. , Uzsoy , R. and Martin-Vega , L.A. ( 1992 ) Efficient algorithms for scheduling semiconductor burn-in operations . Operations Research , 40 , 764 – 775 .
- Monma , C.L. and Potts , C.N. ( 1989 ) On the complexity of scheduling with batch setup times . Operations Research , 37 , 798 – 804 .
- Nadeflf , D. and Santos , C. ( 1988 ) One-pass batching algorithms for the one machine problem . Discrete Applied Mathematics , 21 , 133 – 145 .
- Potts , C.N. and Kovalyov , M.Y. ( 2000 ) Scheduling with batching a review . European Journal of Operations Research , 120 , 228 – 249 .
- Potts , C.N. , Van Wassenhove , L.N. ( 1992 ) Integrating scheduling with batching and lot-sizing a review of algorithms and complexity , Journal of the Operational Research Society , 43 , 395 – 406 .
- Shallcross , D. ( 1992 ) A polynomial algorithm for a one machine batching problem . Operations Research Letters , 11 , 213 – 218 .
- Uzsoy , R. ( 1995 ) Scheduling batch processing machines with incompatible job families . International Journal of Production Research , 33 , 2685 – 2708 .
- Webster , S. and Baker , K.R. ( 1995 ) Scheduling groups of jobs on a single machine . Operations Research , 43 , 692 – 703 .