New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria.
Damien ProtOdile Bellenguez-MorineauChams LahlouPublished in: Eur. J. Oper. Res. (2013)
Keyphrases
- parallel machines
- release dates
- scheduling problem
- sequence dependent setup times
- flowshop
- earliness tardiness
- single machine
- precedence constraints
- parallel machine scheduling problem
- maximum lateness
- processing times
- identical machines
- shared memory
- total weighted tardiness
- setup times
- parallel computing
- np hard
- job processing times
- single server
- single machine scheduling problem
- decision problems
- job shop
- worst case
- job shop scheduling problem
- tabu search
- genetic algorithm
- response time
- dynamic programming
- objective function