An implicit enumeration algorithm for complex scheduling problems
- 1 January 1975
- journal article
- research article
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 13 (1) , 25-40
- https://doi.org/10.1080/00207547508942972
Abstract
Several algorithms have been presented for handling complex scheduling problems. These methods are computationally impractical when confronted with large problems. New algorithms have been developed for solving job-shop problems. They are more efficient than the previous ones because they use dominance and better bound ideas. The purpose of this paper is to present an efficient algorithm for complex scheduling problems generalizing those ideas.Keywords
This publication has 6 references indexed in Scilit:
- On sequencing with earliest starts and due dates with application to computing bounds for the (n/m/G/Fmax) problemNaval Research Logistics Quarterly, 1973
- A Direct Search Method to Locate Negative Cycles in a GraphManagement Science, 1971
- A Method of Solution for General Machine-Scheduling ProblemsOperations Research, 1970
- Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive CaseOperations Research, 1970
- Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration AlgorithmOperations Research, 1969
- Optimum Seeking with Branch and BoundManagement Science, 1966