A Note on NP-Hardness of Preemptive Mean Flow-Time Scheduling for Parallel Machines.
Odile Bellenguez-MorineauMarek ChrobakChristoph DürrDamien ProtPublished in: CoRR (2014)
Keyphrases
- parallel machines
- np hardness
- scheduling problem
- np hard
- unrelated parallel machines
- single machine
- total tardiness
- precedence constraints
- approximation algorithms
- flowshop
- minimize total
- sequence dependent setup times
- processing times
- tabu search
- weighted tardiness
- release dates
- setup times
- special case
- lower bound
- scheduling jobs
- integer programming
- branch and bound algorithm
- optimal solution
- linear programming
- single server
- decision problems
- job shop
- worst case
- linear program
- lagrangian relaxation
- mixed integer
- upper bound
- decision making
- scheduling algorithm