This is a preview. Log in through your library . Abstract The generalized assignment problem examines the maximum profit assignments of jobs to agents such that each job is assigned to precisely one ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback