Login / Signup
A polynomial-time algorithm for the routing flow shop problem with two machines: an asymmetric network with a fixed number of nodes.
Ilya Chernykh
Alexander V. Kononov
Sergey Sevastyanov
Published in:
CoRR (2020)
Keyphrases
</>
fixed number
flowshop
scheduling problem
worst case
computational complexity
objective function
optimal solution
dynamic programming
network structure
parallel machines
search space
np hard
wireless sensor networks
simulated annealing