Journal article
Solving resource-constrained project scheduling problems by a search
Naval research logistics, Vol.37(1), pp.61-84
02/1990
DOI: 10.1002/1520-6750(199002)37:1<61::AID-NAV3220370104>3.0.CO;2-S
Abstract
A new exact method is presented for finding a minimum makespan schedule for a multiresource constrained project scheduling problem. This method employs the philosophical approach used earlier to develop a successful heuristic algorithm for the same class of problems. The approach repairs resource conflicts rather than constructing detailed schedules by dispatching activities. Resource-violating sets of activities are identified whose concurrent execution would violate resource constraints. Repairs are made by imposing a precedence constraint to sequence two activities in such a resource-violating set. Computational results are discussed for a standard set of test problems. An A* algorithm is employed. The most successful version of our algorithm involves some perhaps surprising design choices which might be relevant to the design of A*-like search algorithms in other contexts.
Details
- Title: Subtitle
- Solving resource-constrained project scheduling problems by a search
- Creators
- Colin E. Bell - University of IowaKwangho Park - University of Iowa
- Resource Type
- Journal article
- Publication Details
- Naval research logistics, Vol.37(1), pp.61-84
- DOI
- 10.1002/1520-6750(199002)37:1<61::AID-NAV3220370104>3.0.CO;2-S
- ISSN
- 0894-069X
- eISSN
- 1520-6750
- Publisher
- Wiley Subscription Services, Inc., A Wiley Company; HOBOKEN
- Number of pages
- 24
- Language
- English
- Date published
- 02/1990
- Academic Unit
- Business Analytics
- Record Identifier
- 9984962888702771
Metrics
2 Record Views