A best online algorithm for scheduling on two parallel batch machines

Theoretical Computer Science

Volumn 410, Issue 21-23, 2009, Pages 2291-2294

  Tian, Ji ^a   Fu, Ruyan ^a   Yuan, Jinjiang ^a  

^a ZHENGZHOU UNIVERSITY   (China)

Author keywords

Competitive ratio; Online scheduling; Parallel batch machines

Indexed keywords

BATCH SIZES; COMPETITIVE RATIO; MAKESPAN; ON-LINE ALGORITHMS; ONLINE SCHEDULING; PARALLEL BATCH MACHINES; PARALLEL BATCH PROCESSING;

BATCH DATA PROCESSING; INDUSTRIAL RESEARCH; PARALLEL ALGORITHMS; SCHEDULING;

SCHEDULING ALGORITHMS;

EID: 64249114974     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2009.02.011     Document Type: Article

References (6)

1. Chen B., and Vestjens A.P.A. Scheduling on identical machines: How good is LPT in an on-line setting?. Operations Research Letters 21 (1997) 165-169
2. Li S.G., Li G.J., and Qi X.Q. Minimizing total weighted completion time on identical parallel batch machines. International Journal of Foundations of Computer Science 176 (2006) 1441-1454
3. Noga J., and Seiden S.S. An optimal online algorithm for scheduling two machines with release times. Theoretical Computer Science 268 (2001) 133-143
4. Nong Q.Q., Cheng T.C.E., and Ng C.T. An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines. Operations Research Letters 36 (2008) 584-588
5. Poon C.K., and Yu W.C. A flexible on-line scheduling algorithm for batch machine with infinite capacity. Annals of Operations Research 133 (2005) 175-181
6. Zhang G.C., Cai X.Q., and Wong C.K. Optimal on-line algorithms for scheduling on parallel batch processing machines. IIE Transactions 35 (2003) 175-181