A branch-and-bound algorithm with cyclic best-first search for the permutation flow shop scheduling problem

Author(s):  
Marcus Ritt
Sign in / Sign up

Export Citation Format

Share Document