Approximation algorithms for the three-machine proportionate mixed shop scheduling.
Longcheng LiuYong ChenJianming DongRandy GoebelGuohui LinYue LuoGuanqun NiBing SuYao XuAn ZhangPublished in: Theor. Comput. Sci. (2020)
Keyphrases
- approximation algorithms
- open shop
- parallel machines
- scheduling problem
- flowshop
- precedence constraints
- job shop
- np hard
- batch processing
- sequence dependent setup times
- strongly np hard
- special case
- worst case
- completion times
- minimum cost
- facility location problem
- release dates
- vertex cover
- wafer fabrication
- scheduling algorithm
- primal dual
- randomized algorithms
- constant factor
- network design problem
- setup times
- undirected graph
- approximation ratio
- np hardness
- linear programming
- job shop scheduling
- tabu search
- resource allocation
- job shop scheduling problem
- resource constrained
- single machine
- lower bound
- constant factor approximation
- learning algorithm
- set cover
- production scheduling
- integer programming
- linear program
- search algorithm