Login / Signup
An approximation algorithm for the three-machine scheduling problem with the routes given by the same partial order.
Richard Quibell
Vitaly A. Strusevich
Published in:
Comput. Ind. Eng. (2014)
Keyphrases
</>
partial order
np hard
scheduling problem
optimal solution
objective function
search space
dynamic programming
lattice structure
computational complexity
flowshop
partially ordered
single machine
approximation algorithms
worst case
vertex cover