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

10.1080/07408179208964233

10.1002/1520-6750(199204)39:3<369::AID-NAV3220390307>3.0.CO;2-F

Runyan W.R., 1990, Semiconductor IntegratedCircuit Processing Technology

10.1080/00207549508904839

10.1287/moor.15.3.483

10.1016/S0167-5060(08)70742-8

10.1016/0167-6377(82)90035-9

10.1287/mnsc.33.8.1035

10.1287/opre.39.4.639

10.1016/0166-218X(90)90103-J

Pinedo M., 1995, Scheduling Theory, Algorithms and Systems

10.1287/opre.43.4.692

10.1016/0167-6377(86)90104-5

10.1287/opre.40.4.764

Li C.-L., 1997, European Journal of Operational Research

10.1287/opre.40.4.750

10.1080/00207549308956847

10.1016/0167-6377(93)90030-K

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 .

10.1080/00207549408957026

10.1080/07408179408966627

10.1111/j.1937-5956.1997.tb00415.x

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 .

Dobson , G. and Nabinadom , R.S. ( 1992 ) The batch loading and scheduling problem . Research Report, Simon Graduate School of Business Administration , University of Rochester .

Chandra , P. and Gupta , S. ( 1992 ) An analysis of a last-station-bottleneck semiconductor packaging line . Research Report, Faculty of Management , McGill University .

10.1016/S0167-5060(08)70743-X

10.1287/opre.37.5.798

10.1080/00207546708929772

10.1287/opre.23.2.283

10.1287/moor.6.2.190

10.1080/00207549408956998