On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs
On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs
复制标题
DOI：
10.1007/s10951-008-0084-6
复制
发表时间：
2009-02
影响因子：
2
通讯作者：
Ruyan Fu;Ji Tian;Jinjiang Yuan
中科院分区：
文献类型：
--
作者：
Ruyan Fu;Ji Tian;Jinjiang Yuan
We study the on-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs. In this model, jobs arrive over time and jobs from different families cannot be scheduled in a common batch. We provide a best possible on-line algorithm for the problem with competitive ratio.
