文献类型：期刊文献

英文题名：Online scheduling on two parallel machines with release dates and delivery times

作者：Liu, Peihai[1];Lu, Xiwen[1]

机构：[1]E China Univ Sci & Technol, Dept Math, Shanghai 200237, Peoples R China

年份：2015

卷号：30

期号：2

起止页码：347

外文期刊名：JOURNAL OF COMBINATORIAL OPTIMIZATION

收录：;EI(收录号：20143600023110);WOS:【SCI-EXPANDED(收录号:WOS:000357045600009)】；

基金：The authors would like to thank anonymous referees whose comments helped a lot to improve this paper. This work was supported by the National Nature Science Foundation of China (11101147, 11371137) and the Fundamental Research Funds for the Central Universities.

语种：英文

外文关键词：Scheduling; Delivery times; Parallel machines; Online algorithm

摘要：We consider an online scheduling problem where jobs arrive over time. A set of independent jobs has to be scheduled on two parallel machines, where preemption is not allowed and the number of jobs is unknown in advance. The characteristics of each job, i.e., processing time and delivery time, become known at its release date. Each job is delivered to the destination independently and immediately at its completion time on the machines. The objective is to minimize the time by which all jobs have been delivered. We present an online algorithm which has a competitive ratio of . Finally, our experimental results show that, in practice, the worst case error ratio is much better than the theoretical bound.