Title :
On-Line Rescheduling to Minimize Makespan under a Limit on the Maximum Sequence Disruption
Author :
Mu, Yundong ; Guo, Xiao
Author_Institution :
Coll. of Sci., Henan Univ. of Technol., Zhengzhou, China
Abstract :
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.
Keywords :
Internet; decision making; single machine scheduling; decision making; maximum sequence disruption constraints; online rescheduling problem; single machine rescheduling; Conference management; Costs; Educational institutions; Engineering management; Job shop scheduling; Manufacturing; Production facilities; Single machine scheduling; System performance; Technology management; competitive ratio; on-line algorithm; rescheduling; sequence disruption; single machine; time disruption;
Conference_Titel :
Services Science, Management and Engineering, 2009. SSME '09. IITA International Conference on
Conference_Location :
Zhangjiajie
Print_ISBN :
978-0-7695-3729-0
DOI :
10.1109/SSME.2009.44
