Login / Signup
Efficient Approximation Schemes for the Maximum Lateness Minimization on a Single Machine with a Fixed Operator or Machine Non-Availability Interval.
Imed Kacem
Hans Kellerer
Maryam Seifaddini
Published in:
ISCO (2014)
Keyphrases
</>
single machine
maximum lateness
flowshop
scheduling problem
sequence dependent setup times
scheduling jobs
approximation schemes
release dates
parallel machines
processing times
total weighted tardiness
dynamic programming
release times
completion times
shortest processing time
setup times
precedence constraints
special case
single machine scheduling problem
approximation algorithms
deteriorating jobs
computational complexity