Single Machine Predictive Scheduling Using Inserted Idle Times
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 predictabili...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2014/304808 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832554183313588224 |
|---|---|
| author | Hongli Zhu Hong Zhou |
| author_facet | Hongli Zhu Hong Zhou |
| author_sort | Hongli Zhu |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-d6ca2c4076284e28a38cbcc3a687bd89 |
| institution | Kabale University |
| issn | 1110-757X 1687-0042 |
| language | English |
| publishDate | 2014-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Applied Mathematics |
| spelling | doaj-art-d6ca2c4076284e28a38cbcc3a687bd892025-02-03T05:52:15ZengWileyJournal of Applied Mathematics1110-757X1687-00422014-01-01201410.1155/2014/304808304808Single Machine Predictive Scheduling Using Inserted Idle TimesHongli Zhu0Hong Zhou1School of Economics and Management, Beihang University, Beijing 100191, ChinaSchool of Economics and Management, Beihang University, Beijing 100191, ChinaA 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.http://dx.doi.org/10.1155/2014/304808 |
| spellingShingle | Hongli Zhu Hong Zhou Single Machine Predictive Scheduling Using Inserted Idle Times Journal of Applied Mathematics |
| title | Single Machine Predictive Scheduling Using Inserted Idle Times |
| title_full | Single Machine Predictive Scheduling Using Inserted Idle Times |
| title_fullStr | Single Machine Predictive Scheduling Using Inserted Idle Times |
| title_full_unstemmed | Single Machine Predictive Scheduling Using Inserted Idle Times |
| title_short | Single Machine Predictive Scheduling Using Inserted Idle Times |
| title_sort | single machine predictive scheduling using inserted idle times |
| url | http://dx.doi.org/10.1155/2014/304808 |
| work_keys_str_mv | AT honglizhu singlemachinepredictiveschedulingusinginsertedidletimes AT hongzhou singlemachinepredictiveschedulingusinginsertedidletimes |