Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness.
Arne MensendiekJatinder N. D. GuptaJan HerrmannPublished in: Eur. J. Oper. Res. (2015)
Keyphrases
- minimize total
- identical parallel machines
- processing times
- release dates
- single machine
- scheduling problem
- scheduling jobs
- single machine scheduling problem
- parallel machines
- sequence dependent setup times
- fixed number
- competitive ratio
- setup times
- resource consumption
- dynamic programming
- np hard
- precedence constraints
- integer programming
- flowshop
- strongly np hard