Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
420133 | Discrete Applied Mathematics | 2007 | 7 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Xiangtong Qi,