The Two-Stage Assembly Scheduling Problem: Complexity and Approximation.
Chris N. PottsS. V. Sevast'janovVitaly A. StrusevichLuk N. Van WassenhoveCarin M. ZwaneveldPublished in: Oper. Res. (1995)
Keyphrases
- scheduling problem
- approximation error
- single machine
- increase in computational complexity
- np hard
- tabu search
- approximation algorithms
- computational complexity
- closed form
- worst case
- flowshop
- error tolerance
- metaheuristic
- parallel machines
- precedence constraints
- computational cost
- maximum lateness
- minimizing makespan
- earliness tardiness
- lower bound