Fast approximation algorithms for bi-criteria scheduling with machine assignment costs.
Kangbok LeeJoseph Y.-T. LeungZhao-Hong JiaWenhua LiMichael L. PinedoBertrand M. T. LinPublished in: Eur. J. Oper. Res. (2014)
Keyphrases
- approximation algorithms
- bicriteria
- flowshop
- scheduling problem
- np hard
- special case
- precedence constraints
- completion times
- open shop
- setup times
- sequence dependent setup times
- strongly np hard
- worst case
- processing times
- vertex cover
- parallel machines
- job shop
- efficient solutions
- single machine
- integer linear programming
- knapsack problem
- minimum cost
- material handling
- tabu search
- resource consumption
- shortest path problem
- optimal solution
- linear programming
- primal dual
- integer programming
- constant factor approximation
- lower bound
- computational complexity
- approximation ratio
- release dates
- linear program
- constant factor
- branch and bound algorithm
- optimization problems