A note on NP-hardness of preemptive mean flow-time scheduling for parallel machines.
Odile Bellenguez-MorineauMarek ChrobakChristoph DürrDamien ProtPublished in: J. Sched. (2015)
Keyphrases
- parallel machines
- np hardness
- scheduling problem
- np hard
- unrelated parallel machines
- single machine
- precedence constraints
- sequence dependent setup times
- minimize total
- flowshop
- setup times
- approximation algorithms
- total tardiness
- weighted tardiness
- optimal solution
- processing times
- special case
- scheduling jobs
- release dates
- lower bound
- tabu search
- branch and bound algorithm
- mixed integer
- worst case
- job shop
- integer programming
- linear program
- linear programming
- single server
- lagrangian relaxation
- decision problems
- upper bound
- computational complexity
- search algorithm