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 ...

This paper presents a "branch and bound" algorithm for the following problem: given a project consisting of a set of activities partially ordered by a set of precedence restrictions, with each ...