Approximation Algorithms and a Hardness Result for the Three-Machine Proportionate Mixed Shop.
Longcheng LiuGuanqun NiYong ChenRandy GoebelYue LuoAn ZhangGuohui LinPublished in: AAIM (2018)
Keyphrases
- approximation algorithms
- np hard
- open shop
- worst case
- np hardness
- special case
- vertex cover
- minimum cost
- facility location problem
- set cover
- np complete
- exact algorithms
- job shop
- approximation ratio
- network design problem
- integer programming
- scheduling problem
- strongly np hard
- disjoint paths
- precedence constraints
- linear programming
- constant factor
- lower bound
- flowshop
- error bounds
- constant factor approximation