A Comparison of Exact Approaches for Solving the Multiple Constrained Resource, Project Scheduling Problem

Article Abstract:

A recurring problem in managing project activity involves the allocation of scarce resources to the individual activities comprising the project. Resource conflict resolution decisions must be made whenever the concurrent demand for resources by the competing activities of a project exceeds resource availability. When these resource conflict resolution decisions arise, project managers seek direction on which activities to schedule and which to delay in order that the resulting increase in project duration is the minimum that can be achieved with the given resource availabilities. ties. The procedures examined in this paper are all designed to provide for this type of decision support. Each procedure examined is enumerative based, methodically searching the set of possible solutions in such a way that not all possiblities need be considered individually. The methods differ in the manner in which the tree representing partial schedules is generated and is saved, and differ in the methods which are used to identify and discard inferior partial schedules. Each procedure was found to be generally superior on a specific class of problems, and these classes are identified. (Reprinted by Permission of Publisher.)

Algorithms, Integer programming, Algorithm, Comparative Study, Resource Management, Branch and Bound

---

A Comparison Of Exact Approaches For Solving the Multiple Constrained Resource, Project Scheduling Problem

Article Abstract:

Project scheduling with constrained resources is a problem often faced in project management. How to allocate scarce resources to minimize project delays can be determined by three described procedures: (1) branch and bound enumeration (Davis and Heidorn), (2) branch and bound (Stinson) and (3) implicit enumeration (Talbot). These were compared using the same set of problems and a FORTRAN V program written for each. Each method lends itself to particular kinds of problems. For example the Talbot takes less computer storage. A table gives data on the amount of computer storage required for each procedure. Other tables provide operating characteristics for each procedure and shows procedures expected to produce optimal solutions with minimal use of computer time.

Resource allocation, Scheduling, Programs

---

Similar abstracts:

• Abstracts: Improving resource-constrained project schedules with look-ahead techniques. From the editor
• Abstracts: Approximations of Dynamic, Multilocation Production and Inventory Problems. Heuristics for multimachine scheduling problems with earliness and tardiness costs

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.