文献类型：期刊文献

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

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

机构：[1] Department of Mathematics, East China University of Science and Technology, Shanghai, 200237, China

年份：2013

卷号：8287 LNCS

起止页码：96

外文期刊名：Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

收录：EI(收录号：20152300910441)

语种：英文

外文关键词：Scheduling algorithms

摘要：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 time. 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 (1 + √5)/2 ≈ 1.618. ? Springer International Publishing 2013.