Note: A best online algorithm for scheduling on two parallel batch machines

Authors:
Ji Tian;Ruyan Fu;Jinjiang Yuan
Affiliations:
Department of Mathematics, Zhengzhou University, Zhengzhou, Henan 450052, Peoples Republic of China;Department of Mathematics, Zhengzhou University, Zhengzhou, Henan 450052, Peoples Republic of China;Department of Mathematics, Zhengzhou University, Zhengzhou, Henan 450052, Peoples Republic of China
Venue:
Theoretical Computer Science
Year:
2009

Citing 3
Cited 4

An optimal online algorithm for scheduling two machines with release times

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

Operations Research Letters
Scheduling on identical machines: How good is LPT in an on-line setting?

Operations Research Letters

Online scheduling on unbounded parallel-batch machines to minimize the makespan

Information Processing Letters
Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time

Information Processing Letters
Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead

Information Processing Letters
A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines

Journal of Scheduling

Quantified Score

Hi-index	5.23

Visualization

Abstract

We consider the online scheduling on two parallel batch machines with infinite batch size to minimize makespan, where jobs arrive over time. That is, all information of a job is not available until it is released. For this online scheduling problem, Nong et al. [Q.Q. Nong, T.C.E. Cheng, C.T. Ng, An improved online algorithm for scheduling on two unrestrictive parallel batch processing machines, Operations Research Letters, 36 (2008) 584-588] have provided an online algorithm with competitive ratio no greater than 2. We show that this bound is tight for the problem. Furthermore we give a new best possible online algorithm with a tighter structure.