Publication Type
Journal Article
Version
publishedVersion
Publication Date
4-1998
Abstract
We review recent advances in dealing with the resource-constrained project scheduling problem using an efficient depth-first branch-and-bound procedure, elaborating on the branching scheme, bounding calculations and dominance rules, and discuss the potential of using truncated branch-and-bound. We derive conclusions from the research on optimal solution procedures for the basic problem and subsequently illustrate extensions to a rich and realistic variety of related problems involving activity preemption, the use of ready times and deadlines, variable resource requirements and availabilities, generalized precedence relations, time/cost, time/resource and resource/resource trade-offs and non-regular objective functions.
Discipline
Business Administration, Management, and Operations | Management Information Systems
Research Areas
Operations Management
Publication
Computers and Operations Research
Volume
25
Issue
4
First Page
279
Last Page
302
ISSN
0305-0548
Identifier
10.1016/S0305-0548(97)00055-5
Publisher
Elsevier
Embargo Period
8-31-2021
Citation
HERROELEN, Willy; DE REYCK, Bert; and DEMEULEMEESTER, Erik.
Resource-constrained project scheduling: A survey of recent developments. (1998). Computers and Operations Research. 25, (4), 279-302.
Available at: https://ink.library.smu.edu.sg/lkcsb_research/6740
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Included in
Business Administration, Management, and Operations Commons, Management Information Systems Commons