Algorithms for scheduling with integer preemptions on parallel machines to minimize the maximum lateness.
Yakov ZinderSam WalkerPublished in: Discret. Appl. Math. (2015)
Keyphrases
- parallel machines
- maximum lateness
- release dates
- scheduling problem
- minimize total
- sequence dependent setup times
- precedence constraints
- single machine
- unrelated parallel machines
- setup times
- flowshop
- parallel computing
- single server
- lot sizing
- single machine scheduling problem
- identical parallel machines
- batch processing machines
- processing times
- branch and bound algorithm
- resource allocation