Login / Signup
The routing open-shop problem on a network: Complexity and approximation.
Igor Averbakh
Oded Berman
Ilya Chernykh
Published in:
Eur. J. Oper. Res. (2006)
Keyphrases
</>
open shop
approximation algorithms
job shop
worst case
computational complexity
wireless sensor networks
network structure
parallel machines
network flow
genetic algorithm
optimal solution
special case
network traffic