The "branch-and-bound" algorithm for the exact solution of a three-machine scheduling problem proposed by Lomnicki has been generalized to the case of an arbitrary number of machines (under the ...
We propose a new resolution algorithm, called resolution branch and bound (RBB), where a branch-and-bound scheme is empowered by exploiting the information contained in a family of closed subproblems, ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback