Two machine flow shop scheduling problems with sequence dependent setup times: A dynamic programming approach
- 1 September 1974
- journal article
- research article
- Published by Wiley in Naval Research Logistics Quarterly
- Vol. 21 (3) , 515-524
- https://doi.org/10.1002/nav.3800210311
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- An Implicit Enumeration Algorithm for the Machine Sequencing ProblemManagement Science, 1971
- Sequencing many jobs on a multi-purpose facilityNaval Research Logistics Quarterly, 1971
- A Generalized Machine-Scheduling AlgorithmJournal of the Operational Research Society, 1970
- Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration AlgorithmOperations Research, 1969
- The Traveling Salesman Problem: A SurveyOperations Research, 1968
- Optimum Seeking with Branch and BoundManagement Science, 1966
- Application of the Branch and Bound Technique to Some Flow-Shop Scheduling ProblemsOperations Research, 1965
- Applied Dynamic ProgrammingPublished by Walter de Gruyter GmbH ,1962
- A Dynamic Programming Approach to Sequencing ProblemsJournal of the Society for Industrial and Applied Mathematics, 1962
- Dynamic Programming Treatment of the Travelling Salesman ProblemJournal of the ACM, 1962