Approximation Algorithms for Three-Machine Open Shop Scheduling.
Bo ChenVitaly A. StrusevichPublished in: INFORMS J. Comput. (1993)
Keyphrases
- approximation algorithms
- open shop scheduling
- np hard
- strongly np hard
- special case
- vertex cover
- worst case
- minimum cost
- approximation ratio
- primal dual
- ant colony optimisation
- open shop
- set cover
- undirected graph
- randomized algorithms
- flowshop
- precedence constraints
- scheduling problem
- disjoint paths
- computational intelligence
- polynomial time approximation
- reinforcement learning