An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines

Operations Research Letters

Volumn 36, Issue 5, 2008, Pages 584-588

  Nong, Q Q ^a   Cheng, T C E ^b   Ng, C T ^b  

^a OCEAN UNIVERSITY OF CHINA   (China)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

Batch; Competitive ratio; On line scheduling; Parallel machines; Worst case analysis

Indexed keywords

PARALLEL ALGORITHMS; SCHEDULING;

BATCH; COMPETITIVE RATIO; COMPETITIVE RATIOS; MAKESPAN; ON-LINE ALGORITHMS; ON-LINE SCHEDULING; PARALLEL BATCH PROCESSING; PARALLEL MACHINES; WORST-CASE ANALYSIS;

BATCH DATA PROCESSING;

EID: 50249137689     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2008.03.004     Document Type: Article

References (14)

1. Brucker P., Gladky A., Hoogeveen H., Kovalyvov M.Y., Potts C.N., Tautehahn T., and van de Velde S.L. Scheduling a batching machine. Journal of Scheduling 1 (1998) 31-54
2. Chen B., Deng X., and Zang W. On-line scheduling a batch processing system to minimize total weighted job completion time. Lecture Notes in Computer Science 2223 (2001) 380-389
3. Cheng T.C.E., Ng C.T., Yuan J.J., and Liu Z.H. Single machine parallel batch scheduling subject to precedence constraints. Naval Research Logistics 51 (2004) 949-958
4. Graham R.L., Lawler E.L., Lenstra J.K., and Rinnooy Kan A.H.G. Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals Discrete Mathematics 5 (1979) 287-326
5. Lee C.Y., and Uzsoy R. Minimizing makespan on a single batch processing machine with dynamic job arrivals. International Journal of Production Research 37 (1999) 219-236
6. Lee C.Y., Uzsoy R., and Martin Vega L.A. Efficient algorithms for scheduling semiconductor burn-in operations. Operations Research 40 (1992) 764-775
7. Li S., Li G., Wang X., and Liu Q. Minimizing makespan on a single batching machine with release times and non-identical job sizes. Operations Research Letters 33 (2005) 157-164
8. Liu Z., and Yu W. Scheduling one batch processor subject to job release dates. Discrete Applied Mathematics 105 (2000) 129-136
9. Ng C.T., Cheng T.C.E., and Yuan J.J. A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints. Operations Research Letters 30 (2002) 66-68
10. Ng C.T., Cheng T.C.E., and Yuan J.J. The single machine batching problem with family setup times to minimize maximum lateness is strongly N P-hard. Journal of scheduling 6 (2003) 483-490
11. Uzsoy R. A single batch processing machine with non-identical job sizes. International Journal of Production Research 32 (1994) 1615-1635
12. Yuan J.J., Liu Z.H., Ng C.T., and Cheng T.C.E. The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minnimize makespan. Theoretical Computer Science 320 (2004) 199-212
13. Zhang G., Cai X., and Wong C.K. On-line algorithms for minimizing makespan on batch processing machines. Naval Research Logistics 48 (2001) 241-258
14. Zhang G., Cai X., and Wong C.K. Optimal on-line algorithms for scheduling on parallel batch processing machines. IIE Transactions 35 (2003) 175-181