The strong NP-hardness of two-stage flowshop scheduling with a common second-stage machine.
Bertrand M. T. LinPublished in: Comput. Oper. Res. (1999)
Keyphrases
- flowshop scheduling
- np hardness
- flowshop
- np hard
- scheduling problem
- flowshop scheduling problems
- approximation algorithms
- special case
- mixed integer
- worst case analysis
- linear programming
- tabu search
- optimal solution
- strongly np hard
- parallel machines
- lower bound
- minimizing makespan
- complex systems
- discrete tomography
- optimal policy
- evolutionary algorithm
- computational complexity
- search algorithm