Journal of the Operational Research Society · 1966 · 114 citations · 6 references
ManagementComputer ScienceOperations ManagementAlgorithmsOptimizationSchedulingBranch And BoundInteger ProgrammingJob SchedulingMachine SchedulingResource-constrained SchedulingScheduling TheoryMachine AssignmentScheduling ProblemsSingle-machine Scheduling
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 assumption of an identical order on all the machines) and it has been adapted for an electronic computer. The flow chart of this algorithm used in the programming of calculations has been given and the efficiency of the method has been illustrated by some experimental evaluations of optimum job sequencing.
6