NP-hard cases in scheduling deteriorating jobs on dedicated machines.
Alexander V. KononovStanislaw GawiejnowiczPublished in: J. Oper. Res. Soc. (2001)
Keyphrases
- deteriorating jobs
- scheduling problem
- np hard
- single machine
- flowshop
- parallel machines
- maximum lateness
- release times
- identical parallel machines
- release dates
- identical machines
- single machine scheduling problem
- special case
- lower bound
- precedence constraints
- production scheduling
- sequence dependent setup times
- setup times
- integer programming
- approximation algorithms
- resource allocation
- fixed number
- strongly np hard
- upper bound
- scheduling algorithm
- linear programming