A best online algorithm for scheduling on two parallel batch machines
详细信息 查看全文
- 作者：Ji Tian ; Ruyan Fu ; Jinjiang Yuan
- 关键词：Online scheduling ; Parallel batch machines ; Competitive ratio
- 刊名：Theoretical Computer Science
- 出版年：2009
- 出版时间：17 May 2009
- 年：2009
- 卷：410
- 期：21-23
- 页码：2291-2294
- 全文大小：387 K
文摘
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 . We show that this bound is tight for the problem. Furthermore we give a new best possible online algorithm with a tighter structure.