Login / Signup

No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem.

Marcin MuchaMaxim Sviridenko
Published in: ICALP (1) (2013)
Keyphrases
  • flowshop scheduling
  • flowshop scheduling problems
  • branch and bound algorithm
  • flowshop
  • branch and bound
  • combinatorial optimization problems
  • neural network
  • cooperative
  • lower bound
  • parallel machines
  • hard problems