A note on reverse scheduling with maximum lateness objective.
S. S. LiPeter BruckerChi To NgT. C. Edwin ChengNatalia V. ShakhlevichJinjiang YuanPublished in: J. Sched. (2013)
Keyphrases
- maximum lateness
- single machine
- parallel machine scheduling problem
- scheduling problem
- release dates
- parallel machines
- sequence dependent setup times
- precedence constraints
- batch processing machines
- flowshop
- deteriorating jobs
- processing times
- single machine scheduling problem
- branch and bound algorithm
- setup times
- dynamic programming
- approximation algorithms
- upper bound
- resource consumption
- high volume
- partially ordered
- lower and upper bounds
- partial order
- search algorithm