Single Machine Predictive Scheduling Using Inserted Idle Times

Hongli Zhu and Hong Zhou

Journal of Applied Mathematics, 2014, vol. 2014, issue 1

Abstract: A single machine predictive scheduling problem is considered. The primary objective is to minimize the total completion times. The predictability of the schedule is measured by the completion time deviations between the predictive schedule and realized schedule. The surrogate measure of predictability is chosen to evaluate the completion time deviations. Both of the primary objective and predictability are optimized. In order to absorb the effects of disruptions, the predictive schedule is generated by inserting idle times. Right‐shift rescheduling method is used as the rescheduling strategy. Three methods are designed to construct predictive schedules. The computational experiments show that these algorithms provide high predictability with minor sacrifices in shop performance.

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2014/304808

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:wly:jnljam:v:2014:y:2014:i:1:n:304808

Access Statistics for this article

More articles in Journal of Applied Mathematics from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().