Herroelen, W and De Reyck, B and Demeulemeester, E (1998) Resource-constrained project scheduling: A survey of recent developments. COMPUT OPER RES , 25 (4) 279 - 302.
Full text not available from this repository.
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. (C) 1998 Published by Elsevier Science Ltd. All rights reserved.
|Title:||Resource-constrained project scheduling: A survey of recent developments|
|Keywords:||NET PRESENT VALUE, MULTIPLE-RESOURCE, COMPUTATIONAL EXPERIENCE, HIERARCHICAL-MODELS, ACTIVITY NETWORKS, GENERAL-CLASS, BRANCH, PRECEDENCE, PERFORMANCE, COMPLEXITY|
|UCL classification:||UCL > School of BEAMS > Faculty of Engineering Science > Management Science and Innovation|
Archive Staff Only: edit this record