On sequencing with earliest starts and due dates with application to computing bounds for the (n/m/G/Fmax) problem
- 1 March 1973
- journal article
- research article
- Published by Wiley in Naval Research Logistics Quarterly
- Vol. 20 (1) , 57-67
- https://doi.org/10.1002/nav.3800200106
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- An Implicit Enumeration Algorithm for the Machine Sequencing ProblemManagement Science, 1971
- Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive CaseOperations Research, 1970
- Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration AlgorithmOperations Research, 1969