Efficient approximation algorithms for the routing open shop problem.

Ilya Chernykh Alexander V. Kononov Sergey Sevastyanov

Published in: Comput. Oper. Res. (2013)

Keyphrases

approximation algorithms
open shop
np hard
special case
job shop
worst case
vertex cover
primal dual
minimum cost
constant factor
routing protocol
parallel machines
scheduling problem
routing algorithm
job shop scheduling
multistage
metaheuristic
np complete
sensor networks