Note: A note on worst-case performance of heuristics for maintenance scheduling problems

Authors:
Xiangtong Qi
Affiliations:
Department of Industrial Engineering and Logistics Management, Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong
Venue:
Discrete Applied Mathematics
Year:
2007

Citing 2
Cited 5

Approximation algorithms for bin packing: a survey

Approximation algorithms for NP-hard problems
Scheduling on uniform parallel machines to minimize maximum lateness

Operations Research Letters

Approximation algorithm for the weighted flow-time minimization on a single machine with a fixed non-availability interval

Computers and Industrial Engineering
Short Communication: Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed non-availability interval

Computers and Industrial Engineering
Minimizing total completion time on a single machine with a flexible maintenance activity

Computers and Operations Research
Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates

Journal of Scheduling
Integrated production scheduling and maintenance policy for robustness in a single machine

Computers and Operations Research

Quantified Score

Hi-index	0.04

Visualization

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.