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

The Journal of the Operational Research Society, Vol. 48, No. 8 (Aug., 1997), pp. 804-809 (6 pages) A new algorithm for the generalised assignment problem is described in this paper. The algorithm is ...