A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint.
Joachim BreitPublished in: Comput. Oper. Res. (2006)
Keyphrases
- polynomial time approximation
- scheduling problem
- np hard
- approximation algorithms
- single machine
- error bounds
- optimal solution
- integer programming
- flowshop
- processing times
- identical machines
- special case
- setup times
- minimum cost
- tabu search
- worst case
- minimizing makespan
- parallel machines
- lower bound
- permutation flowshop
- job shop scheduling problem
- linear programming
- precedence constraints
- bin packing
- computational complexity
- branch and bound algorithm
- constraint satisfaction problems
- search algorithm
- learning algorithm