Journal of the Operational Research Society · 1965 · 244 citations · 4 references
ComputingComputer ScienceIndustrial EngineeringAlgorithmsOptimizationSchedulingBranch And BoundJob SchedulingMachine SchedulingScheduling TheoryMachine AssignmentThree-machine Scheduling
By combining Roy's graph-theoretical interpretation of the problem of job scheduling on machines and some general results of his theory with the “branch-and-bound” method recently applied by Little et al. to the travelling salesman problem an algorithm has been obtained for the exact solution of the scheduling problem in the case of three machines. The working of the algorithm has been illustrated by numerical examples and possibilities of further investigations have been indicated.
4
An Algorithm for the Traveling Salesman Problem
John D. C. Little, Katta G. Murty, Dura W. Sweeney et al. · Operations Research · 1963 · 1K citations · Full text