A note on worst-case performance of heuristics for maintenance scheduling problems |
| |
| Authors: | Xiangtong Qi |
| |
| Institution: | Department of Industrial Engineering and Logistics Management, Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong |
| |
| Abstract: | We study a machine scheduling model in which job scheduling and machine maintenance activities have to be considered simultaneously. We develop the worst-case bounds for some heuristic algorithms, including a sharper worst-case bound of the SPT schedule than the results in the literature, and another bound of the EDD schedule. |
| |
| Keywords: | Scheduling Maintenance SPT schedule EDD schedule Worst-case bound |
| 本文献已被 ScienceDirect 等数据库收录！ |
