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

Published in: Discret. Appl. Math. (2007)

Keyphrases

scheduling problem
worst case
greedy heuristics
np hard
list scheduling
worst case analysis
preventive maintenance
running times
set cover

average case
greedy algorithm
approximation algorithms
lower bound
greedy heuristic
upper bound
single machine
software maintenance
job shop scheduling

job shop scheduling problem
special case
processing times
flowshop
precedence constraints
tabu search
setup times
job shop
parallel machines

sequencing problems
limited capacity
search algorithm
maximum lateness
times faster
error bounds
heuristic methods
memetic algorithm