A stable scheduling for single machine under uncertainty

The single machine scheduling problem subject to random machine breakdowns is addressed in this paper, where jobs arrive at system dynamically. A modified version of optimized surrogate measure heuristic (OSMH) developed by Mehta and Uzsoy (1999) is proposed, i.e., Modified optimized surrogate measu...

Full description

Saved in:
Bibliographic Details
Published in2009 IEEE International Conference on Automation and Logistics pp. 526 - 531
Main Authors Qiaoyun Li, Bing Wang
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.08.2009
Subjects
Dynamic scheduling
Electric breakdown
Job shop scheduling
Manufacturing
Predictive models
predictive schedule
Probability distribution
Processor scheduling
Single machine scheduling
Stability
Uncertainty
Online AccessGet full text
ISBN9781424447947
1424447941
ISSN2161-8151
DOI10.1109/ICAL.2009.5262865

Cover

More Information
Summary:The single machine scheduling problem subject to random machine breakdowns is addressed in this paper, where jobs arrive at system dynamically. A modified version of optimized surrogate measure heuristic (OSMH) developed by Mehta and Uzsoy (1999) is proposed, i.e., Modified optimized surrogate measure heuristic (MOSMH). The idea behind the heuristic MOSMH is to make full use of the idle times probably existing in initial schedule. The stability of the predictive schedule is measured by the sum of the weighted absolute deviation between the planned job completion times and the realized one. Extensive computational results show that the heuristic MOSMH proposed in this paper significantly improves the schedule stability without deteriorating the efficiency performance and the predictive schedule obtained by MOSMH is more insensitive to the various breakdown scenarios than the heuristic OSMH.
ISBN:9781424447947
1424447941
ISSN:2161-8151
DOI:10.1109/ICAL.2009.5262865