Project scheduling with resource constraints: A branch and bound approach
- 1 June 1987
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 29 (3) , 262-273
- https://doi.org/10.1016/0377-2217(87)90240-2
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Multiple Resource–Constrained Scheduling Using Branch and BoundA I I E Transactions, 1978
- An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling ProblemsManagement Science, 1978
- Scheduling a Project Under Multiple Resource Constraints: A Zero-One Programming ApproachA I I E Transactions, 1976
- A Comparison of Heuristic and Optimum Solutions in Resource-Constrained Project SchedulingManagement Science, 1975
- Validation of subgradient optimizationMathematical Programming, 1974
- An Algorithm for Project (Job) Sequencing with Resource ConstraintsOperations Research, 1972
- An Algorithm for Optimal Project Scheduling under Multiple Resource ConstraintsManagement Science, 1971
- Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration AlgorithmOperations Research, 1969
- Multiproject Scheduling with Limited Resources: A Zero-One Programming ApproachManagement Science, 1969
- An Algorithm for the Line Balancing ProblemManagement Science, 1964