Login / Signup

A 6/5-approximation algorithm for the two-machine routing open-shop problem on a two-node network.

Igor AverbakhOded BermanIlya Chernykh
Published in: Eur. J. Oper. Res. (2005)
Keyphrases
  • optimal solution
  • computational complexity
  • np hard
  • dynamic programming
  • worst case
  • network flow
  • open shop
  • simulated annealing
  • linear programming
  • shortest path
  • memetic algorithm
  • parallel machines