Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness.
Jinjiang YuanC. T. NgT. C. Edwin ChengPublished in: J. Sched. (2015)
Keyphrases
- maximum lateness
- release dates
- completion times
- single machine
- single machine scheduling problem
- precedence constraints
- scheduling problem
- processing times
- parallel machines
- deteriorating jobs
- sequence dependent setup times
- flowshop
- branch and bound algorithm
- parallel machine scheduling problem
- setup times
- dynamic programming
- approximation algorithms
- tabu search
- partially ordered
- partial order
- resource allocation