Online scheduling on two parallel machines with release dates and delivery times

摘要

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.