Scheduling on uniform parallel machines to minimize maximum lateness.
Christos KoulamasGeorge J. KyparisisPublished in: Oper. Res. Lett. (2000)
Keyphrases
- maximum lateness
- single machine
- scheduling problem
- release dates
- parallel machines
- batch processing machines
- precedence constraints
- completion times
- flowshop
- sequence dependent setup times
- deteriorating jobs
- processing times
- setup times
- parallel algorithm
- approximation algorithms
- simulated annealing
- partially ordered
- single machine scheduling problem
- dynamic programming
- np hard
- special case