Multiple Allocation Of Resources In A Network An Optimal Scheduling Algorithm*
- 1 February 1974
- journal article
- research article
- Published by Taylor & Francis in INFOR: Information Systems and Operational Research
- Vol. 12 (1) , 25-38
- https://doi.org/10.1080/03155986.1974.11731561
Abstract
This paper presents an optimal algorithm for scheduling a project network when the tasks are operating in a resource pool which has a finite upper bound on each resource type. A state space description of task processing time is used in the dynamic programming formulation. A finite time processing interval and a penalty cost rate ia assigned to each task to cost the system in the optimal search.Keywords
This publication has 5 references indexed in Scilit:
- Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive CaseOperations Research, 1970
- Methods for analyzing data from computer simulation experimentsCommunications of the ACM, 1967
- Decision CPM: A Method for Simultaneous Planning, Scheduling, and Control of ProjectsOperations Research, 1967
- Some Properties of Schedules for Large Projects with Limited ResourcesOperations Research, 1964
- Preventive Maintenance Scheduling by Mathematical ProgrammingManagement Science, 1964