Predictive Scheduling for a Single Machine with Random Machine Breakdowns

Hongli Zhu () and Hong Zhou ()
Additional contact information
Hongli Zhu: Beihang University
Hong Zhou: Beihang University

A chapter in LISS 2013, 2015, pp 753-758 from Springer

Abstract: Abstract We investigate a predictive scheduling problem to minimize the total completion times with random machine breakdowns. The predictability of the schedule is measured by the completion time deviations between the predictive schedule and realized schedule. We provide three algorithms to construct predictive schedules. The computational experiments show that these algorithms provide high predictability with minor sacrifices in shop performance. The feedback algorithm has advantages in both predictability and shop performance.

Keywords: Predictive scheduling; Rescheduling; Machine breakdowns (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-40660-7_113

Ordering information: This item can be ordered from
http://www.springer.com/9783642406607

DOI: 10.1007/978-3-642-40660-7_113

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().