Optimal on-line algorithms for scheduling on parallel batch processing machines

IIE Transactions (Institute of Industrial Engineers)

Volumn 35, Issue 2, 2003, Pages 175-181

  Zhang, Guochuan ^a   Cai, Xiaoqiang ^b   Wong, C K ^b,c  

^a ZHEJIANG UNIVERSITY   (China)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^c IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ONLINE SYSTEMS; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; POLYNOMIALS; THEOREM PROVING;

COMPETITIVE RATIO; PARALLEL BATCH PROCESSING MACHINES;

SCHEDULING;

EID: 0037322232     PISSN: 0740817X     EISSN: None     Source Type: Journal    
DOI: 10.1080/07408170304378     Document Type: Article

References (14)

1. Ahmadi, J.H., Ahmadi, R.H., Dasu, S. and Tang, C.S. (1992) Batching and scheduling jobs on batch and discrete processors. Operations Research, 39, 750-763.
2. Brucker, P., Gladky, A., Hoogeveen, H., Kovalyov, M.Y., Potts, C.N., Tautenhahn, T. and Van de Velde, S. (1998) Scheduling a batching machine. Journal of Scheduling, 1, 31-54.
3. Chandru, V., Lee, C.-Y. and Uzsoy, R. (1993a) Minimizing total completion time on a batch processing machine with job families. Operations Research Letters, 13, 61-65.
4. Chandru, V., Lee, C.-Y. and Uzsoy, R. (1993b) Minimizing total completion time on batch processing machines. International Journal of Production Research, 31, 2097-2121.
5. Hochbaum, D.S. and Landy, D. (1997) Scheduling semiconductor burn-in operations to minimize total flowtime. Operations Research, 45, 874-885.
6. Hoogeveen, H. and Van de Velde, S. (1998) Scheduling by positional completion times: analysis of a two-stage flow shop problem with a batching machine. Mathematical Programming, 82, 273-289.
7. Ikura, Y. and Gimple, M. (1986) Efficient scheduling algorithms for a single batch processing machine. Operations Research Letters, 5, 61-65.
8. Lee, C.Y. and Uzsoy, R. (1999) Minimizing makespan on a single batch processing machine with dynamic job arrivals. International Journal of Production Research, 37, 219-236.
9. Lee, C.Y., Uzsoy, R. and Martin-Vega, L.A. (1992) Efficient algorithms for scheduling semiconductor burn-in operations. Operations Research, 40, 764-775.
10. Li, C.-L. and Lee, C.Y. (1997) Scheduling with agreeable release times and due dates on a batch processing machine. European Journal of Operational Research, 96, 564-569.
11. Liu, Z. and Yu, W. (2000) Scheduling one batch processor subject to job release dates. Discrete Applied Mathematics, 105, 129-136.
12. Potts, C.N. and Kovalyov, M.Y. (2000) Scheduling with batching: a review. European Journal of Operational Research, 120, 228-249.
13. Sung, C.S. and Choung, Y.I. (2000) Minimizing makespan on a single burn-in oven in semiconductor manufacturing. European Journal of Operational Research, 120, 559-574.
14. Zhang, G.C., Cai, X.Q. and Wong, C.K. (2001) On-line algorithms for minimizing makespan on batch processing machines. Naval Research Logistics, 48, 241-258.