A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem.
Petra SchuurmanGerhard J. WoegingerPublished in: Theor. Comput. Sci. (2000)
Keyphrases
- polynomial time approximation
- makespan minimization
- np hard
- scheduling problem
- approximation algorithms
- flowshop
- error bounds
- bin packing
- special case
- open shop
- identical machines
- np complete
- neural network
- setup times
- lower bound
- flowshop scheduling problems
- unrelated parallel machines
- minimum cost
- flowshop scheduling
- approximation guarantees
- tabu search
- objective function