A note on the complexity of scheduling problems with linear job deterioration.
Christos KoulamasS. S. PanwalkarPublished in: J. Glob. Optim. (2015)
Keyphrases
- scheduling problem
- processing times
- flowshop
- deteriorating jobs
- single machine
- job shop
- limited capacity
- release dates
- linear complexity
- maximum lateness
- single machine scheduling problem
- parallel machine scheduling problem
- earliness tardiness
- decision problems
- completion times
- setup times
- computational complexity
- sequence dependent setup times
- neural network
- information systems
- release times
- error tolerance
- special case
- np hard
- parallel machines
- tabu search
- job shop scheduling
- database
- precedence constraints