A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint.
Weitian TongYao XuHuili ZhangPublished in: Theor. Comput. Sci. (2022)
Keyphrases
- polynomial time approximation
- np hard
- identical machines
- makespan minimization
- approximation algorithms
- minimizing makespan
- error bounds
- scheduling problem
- processing times
- flowshop
- special case
- lower bound
- bin packing
- single machine
- total flowtime
- strongly np hard
- optimal solution
- minimum cost
- worst case
- total weighted tardiness
- approximation guarantees
- shared memory
- total tardiness
- linear program
- computational complexity