Exact, Approximate, and Guaranteed Accuracy Algorithms for the Flow-Shop Problem n / 2 / F / F¯
- 1 January 1975
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 22 (1) , 106-114
- https://doi.org/10.1145/321864.321872
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation ProblemsJournal of the ACM, 1974
- An Approach to Solving Linear Discrete Optimization ProblemsJournal of the ACM, 1970
- Machine sequencing: Disjunctive graphs and degree-constrained subgraphsNaval Research Logistics Quarterly, 1970
- Computer Solutions of the Traveling Salesman ProblemBell System Technical Journal, 1965