Improved approximation algorithms for two-stage flowshops scheduling problem.
Guangwei WuJianer ChenJianxin WangPublished in: Theor. Comput. Sci. (2020)
Keyphrases
- approximation algorithms
- scheduling problem
- np hard
- minimizing makespan
- flowshop
- total flowtime
- strongly np hard
- total tardiness
- permutation flowshop
- special case
- single machine
- precedence constraints
- total weighted tardiness
- vertex cover
- minimum cost
- worst case
- processing times
- open shop
- setup times
- parallel machines
- facility location problem
- network design problem
- randomized algorithms
- lower bound
- set cover
- job shop scheduling
- integer programming
- optimal solution
- linear programming
- tabu search
- constant factor
- release dates
- approximation ratio
- sequence dependent setup times
- approximation schemes
- primal dual
- combinatorial auctions
- job shop scheduling problem
- branch and bound algorithm
- greedy algorithm
- error bounds
- linear program