Minimizing mean flow times criteria on a single batch processing machine with non-identical jobs sizes

International Journal of Production Economics - Tập 55 - Trang 273-280 - 1998
Fariborz Jolai Ghazvini1, Lionel Dupont1
1Institut National Polytechnique de Grenoble (INPG), Ecole National supérieur de Génie Industriel (ENSGI), Laboratoire GILCO 46, Avenue Félix Viallet, 38031 Grenoble, France

Tài liệu tham khảo

Ahmadi, 1992, Batching and scheduling jobs on batch and discrete processors, Operations Research, 40, 750, 10.1287/opre.40.4.750 Uzsoy, 1994, A single batch processing machine with non-identical job sizes, International Journal of Production Research, 32, 1615, 10.1080/00207549408957026 Ikura, 1986, Efficient scheduling algorithms for a single batch processing machine, Operations Research Letters, 5, 61, 10.1016/0167-6377(86)90104-5 Lee, 1992, Efficient algorithms for scheduling semiconductor burn-in operations, Operations Research, 40, 764, 10.1287/opre.40.4.764 Li, 1997, Scheduling with agreeable release times and due dates on a batch processing machine, European Journal of Operation Research, 96, 564, 10.1016/0377-2217(95)00332-0 P. Brucker, A. Gladky, H. Hoogeveen, M.Y. Kovalyov, C. Potts, T. Tautenhahn, S. Van De Velde, Scheduling a batching machine, Working paper, Universitaet Osnabrueck, Germany, 1996. V. Chandru, C.Y. Lee, R. Uzsoy, Minimizing total completion time on batch processing machines, International Journal of Production Research 31 (1993a) 2097–2121. L. Dupont, F. Jolai Ghazvini, Branch and bound method for minimizing mean flow time on a single batch processing machine, International Journal of Industrial Engineering: Applications and Practice 4 (1997c) 197–203. L. Dupont, F. Jolai Ghazvini, An efficient heuristic for minimizing mean flow time on a single batch processing machine, Proceeding (CD-ROM) of the Second International French–Quebec Congress of Industrial Engineering, Albi, France, Paper No. 36, 1997a. Uzsoy, 1997, Minimizing total weighted completion time on a single batch processing machine, Production and Operations Management, 6, 57, 10.1111/j.1937-5956.1997.tb00415.x C.Y. Lee, R. Uzsoy, Minimizing makespan on a single batch processing machine with dynamic job arrivals, International Journal of Production Research (1998) forthcoming. K.G. Kempf, R. Uzsoy, C.-S. Wang, Scheduling a single batch processing machine with secondary resource constraints. Journal of Manufacturing Systems (1998), forthcoming. Uzsoy, 1995, Scheduling batch processing machines with incompatible job families, International Journal of Production Research, 33, 2685, 10.1080/00207549508904839 S.V. Mehta, R. Uzsoy, Minimizing total tardiness on a batch processing machine with incompatible job families, IIE Transactions on Scheduling and Logistics (1998) forthcoming. G. Dobson, R.S. Nambinadom, The batch loading and scheduling problem, Research report, Simon School of Business Administration, University of Rochester, Rochester, NY, USA, 1992. V. Chandru, C.Y. Lee, R. Uzsoy, Minimizing total completion time on a batch processing machine with job families, Operations Research Letters 13 (1993b) 61–65. D.S. Hochbaum, D. Landy, Algorithms and heuristics for scheduling semiconductor burn-in operations, Research Report ESRC 94-8, University of California, Berkeley, USA, 1994. L. Dupont, F. Jolai Ghazvini, Minimizing makespan on a single batch processing machine with non identical jobs, Proceeding of International Conference on Industrial Engineering and Production Management, Lyon, France, Book II, 1997b, pp. 57–66.