Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems
- 6 November 1990
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 49 (1) , 68-79
- https://doi.org/10.1016/0377-2217(90)90121-q
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- A Comparison of Exact Approaches for Solving the Multiple Constrained Resource, Project Scheduling ProblemManagement Science, 1984
- Multiobjective network scheduling with efficient use of renewable and nonrenewable resourcesEuropean Journal of Operational Research, 1981
- ON CERTAIN MODELS OF RESOURCE ALLOCATION PROBLEMSKybernetes, 1980
- 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
- Algorithm 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling [H]ACM Transactions on Mathematical Software, 1977
- Scheduling a Project Under Multiple Resource Constraints: A Zero-One Programming ApproachA I I E Transactions, 1976
- A Horizon-Varying, Zero-One Approach to Project SchedulingManagement Science, 1974
- Project Scheduling under Resource Constraints—Historical Review and Categorization of ProceduresA I I E Transactions, 1973
- Multiproject Scheduling with Limited Resources: A Zero-One Programming ApproachManagement Science, 1969