Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-Hard.
Wenci YuHan HoogeveenJan Karel LenstraPublished in: J. Sched. (2004)
Keyphrases
- scheduling problem
- minimizing makespan
- np hard
- flowshop
- total flowtime
- single machine
- processing times
- parallel machines
- communication delays
- permutation flowshop
- lower bound
- setup times
- processing units
- tabu search
- precedence constraints
- precedence relations
- special case
- approximation algorithms
- np complete
- integer programming
- optimal solution
- constraint satisfaction problems
- worst case
- greedy heuristic
- linear programming
- branch and bound algorithm
- computational complexity
- state information
- strongly np hard
- lagrangian relaxation
- genetic algorithm