A note on worst-case performance of heuristics for maintenance scheduling problems
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.
maintenance scheduling worst-case bound spt schedule edd schedule