A Multi-Resource Project Scheduling Algorithm
- 1 March 1977
- journal article
- research article
- Published by Taylor & Francis in A I I E Transactions
- Vol. 9 (1) , 44-52
- https://doi.org/10.1080/05695557708975120
Abstract
A heuristic algorithm for scheduling a multi-resource project is described where the objective is to minimize the project cost for any project duration between some specified time range. Input conditions are realistic and include alternative resource combinations (ARCs) for each activity, resource cost functions and hiring and dismissal costs for changes in resource quantities. The algorithm selects that combination of activity ARCs that gives the minimum cost solution for any feasible project duration, and eventually generates the Variable Cost-Time trade-off relationship from which the minimum cost conditions for the project can be found.Keywords
This publication has 14 references indexed in Scilit:
- A Comparison of Heuristic and Optimum Solutions in Resource-Constrained Project SchedulingManagement Science, 1975
- Alternate methods of project scheduling with limited resourcesNaval Research Logistics Quarterly, 1973
- Resource-constrained Project Scheduling — The State of the ArtJournal of the Operational Research Society, 1972
- On Resource Allocation in Project NetworksJournal of the Operational Research Society, 1972
- A Branch and Bound Algorithm for Minimizing Cost in Project SchedulingManagement Science, 1971
- An Algorithm for Optimal Project Scheduling under Multiple Resource ConstraintsManagement Science, 1971
- Multiproject Scheduling with Limited Resources: A Zero-One Programming ApproachManagement Science, 1969
- Optimization of Resource Allocation in Project PlanningOperations Research, 1968
- Some Properties of Schedules for Large Projects with Limited ResourcesOperations Research, 1964
- Resource allocation and multi-project scheduling (RAMPS)--a new tool in planning and controlThe Computer Journal, 1963