Back to search
A “Branch-and-Bound” Algorithm for the Exact Solution of the Three-Machine Scheduling Problem
Data up to Jan 2025
Published1965
Citations243
References4
Total Citations Per Year
Abstract
References (4)
Optimal two‐ and three‐stage production schedules with setup times included
1954 • 3,158 citations
An Algorithm for the Traveling Salesman Problem
1963 • 1,029 citations
Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time—A Quick Method of Obtaining a Near Optimum
1965 • 523 citations
Approximate Solutions to the Three-Machine Scheduling Problem
1964 • 64 citations
Cited By (0)
Loading...