Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments.
Jianming DongJoshua ChangBing SuJueliang HuGuohui LinPublished in: J. Sched. (2020)
Keyphrases
- approximation algorithms
- open shop scheduling
- np hard
- scheduling problem
- special case
- vertex cover
- minimum cost
- worst case
- processing times
- open shop
- ant colony optimisation
- precedence constraints
- theoretical analysis
- machine learning
- disjoint paths
- primal dual
- approximation ratio
- decision trees
- constant factor approximation
- optimal solution
- randomized algorithms
- set cover
- lower bound
- undirected graph
- upper bound