O(log m)-approximation for the routing open shop problem.
Alexander KononovPublished in: RAIRO Oper. Res. (2015)
Keyphrases
- open shop
- approximation algorithms
- job shop
- special case
- np hard
- worst case
- routing algorithm
- routing protocol
- multistage
- ad hoc networks
- minimum cost
- parallel machines
- scheduling problem
- shortest path
- precedence constraints
- routing problem
- knapsack problem
- resource constrained
- job shop scheduling
- sensor networks
- neural network