On-Line Rescheduling to Minimize Makespan under a Limit on the Maximum Disruptions

Abstract

In the on-line rescheduling on a single machine, aset of original jobs has already been scheduled to minimizesome cost objective, when a new set of jobs arrives overtime. The decision maker needs to insert the new jobs intothe existing schedule without excessively disrupting it. Inthis paper, we consider the on-line rescheduling problem tominimize makespan under a limit on the maximum disruptionconstraints and give an on-line algorithm of competitive ratio3/2.