Refining the boundary between P and NP for identical machine scheduling problems with preemption and release dates
Damien ProtOdile Bellenguez-MorineauChams LahlouPublished in: CoRR (2011)
Keyphrases
- release dates
- parallel machines
- scheduling problem
- flowshop
- sequence dependent setup times
- np hard
- single machine
- precedence constraints
- earliness tardiness
- parallel machine scheduling problem
- processing times
- maximum lateness
- completion times
- total weighted tardiness
- setup times
- batch processing
- job processing times
- computational complexity
- tabu search
- identical parallel machines
- np complete
- parallel computing
- approximation algorithms
- job shop
- strongly np hard
- identical machines
- single machine scheduling problem
- single server
- hybrid algorithm
- ant colony optimization
- special case