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

In the on-line rescheduling on a single machine, a set of original jobs has already been scheduled to minimize some cost objective, when a new set of jobs arrives overtime. The decision maker needs to insert the new jobs into the existing schedule without excessively disrupting it. In this paper, we...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Yundong Mu, Xiao Guo
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	competitive ratio Conference management Costs Educational institutions Engineering management Job shop scheduling Manufacturing on-line algorithm Production facilities rescheduling sequence disruption single machine Single machine scheduling System performance Technology management time disruption
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	In the on-line rescheduling on a single machine, a set of original jobs has already been scheduled to minimize some cost objective, when a new set of jobs arrives overtime. The decision maker needs to insert the new jobs into the existing schedule without excessively disrupting it. In this paper, we consider the online rescheduling problem to minimize makespan under a limit on the maximum sequence disruption constraints and give an online algorithm of competitive ratio 3/2.
DOI:	10.1109/SSME.2009.44