Improving the preemptive bound for the single machine dynamic maximum lateness problem.

Federico Della Croce Vincent T'kindt

Published in: Oper. Res. Lett. (2010)

Keyphrases

single machine
maximum lateness
scheduling problem
processing times
total weighted tardiness
release dates
sequence dependent setup times
release times
competitive ratio
upper bound
precedence constraints
flowshop
single machine scheduling problem
parallel machines
worst case
lower bound
np hard