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 Tactical Fixed Interval Scheduling Problem (TFISP) is the problem of determining the minimum number of parallel nonidentical machines, such that a feasible schedule exists for a given set of jobs.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback