Minimizing total completion time on a batch processing machine with job families

Operations Research Letters - Tập 13 - Trang 61-65 - 1993
Vijaya Chandru1
1Department of Computer Science and Automation, Indian Institute of Science, Bangalore 560-012, India

Tài liệu tham khảo

Ahmadi, 1993, Batching and scheduling jobs on batch and discrete processors, Oper. Res., 40, 750, 10.1287/opre.40.4.750 Chandru, V., C.Y. Lee and R. Uzsoy, “Minimizing total completion time on batch processing machines”, Int. J. Prod. Res. (forthcoming). Deb, 1973, Optimal control of batch service queues, Adv. in Appl. Probab., 5, 340, 10.2307/1426040 Fowler, 1990, Strategic control of multichannel bulk server diffusion/oxidation processes Glassey, 1991, Dynamic batching heuristics for simultaneous processing, IEEE Trans. Semiconductor Manufacturing, 4, 77, 10.1109/66.79719 Ikura, 1986, Scheduling algorithms for a single batch processing machine, Oper. Res. Lett., 5, 61, 10.1016/0167-6377(86)90104-5 Lee, 1992, Efficient algorithms for scheduling semiconductor burn-in operations, Oper. Res., 40, 764, 10.1287/opre.40.4.764 Medhi, 1975, Waiting time distribution in a Poisson queue with a general bulk service rule, Management Sci., 21, 777, 10.1287/mnsc.21.7.777 Neuts, 1967, A general class of bulk queues with poisson input, Ann. Math. Statist., 38, 759, 10.1214/aoms/1177698869