Abstract
We consider online scheduling with bi-criteria on parallel batch machines, where the batch capacity is unbounded. In this paper, online means that jobs’ arrival is over time. The objective is to minimize the maximum machine cost subject to the makespan being at its minimum. In unbounded parallel batch scheduling, a machine can process several jobs simultaneously as a batch. The processing time of a job and a batch is equal to 1. When job J j is processed on machine M i , it results cost c i j . We only consider two types of cost functions: c i j = a + c j and c i j = a · c j , where a is the fixed cost of machines and c j is the cost of job J j . The number of jobs is n and the number of machines is m. For this problem, we provide two online algorithms, which are showed to be the best possible with a competitive ratio of ( 1 + β m , ⌈ n m ⌉ ) , where β m is the positive root of the equation ( 1 + β m ) m + 1 = β m + 2 .
Funder
National Natural Science Foundation of China
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献