Resource-constrained project scheduling : A survey of recent developments
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. (C) 1998 Published by Elsevier Science Ltd. All rights reserved.Download Info
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.Bibliographic Info
Paper provided by Katholieke Universiteit Leuven in its series Open Access publications from Katholieke Universiteit Leuven with number urn:hdl:123456789/101588.Length:
Date of creation: Apr 1998
Date of revision:
Publication status: Published in Computers & operations research (1998-04) v.25, p.279-302
Handle: RePEc:ner:leuven:urn:hdl:123456789/101588
Contact details of provider:
Web page: http://www.kuleuven.be
Related research
Keywords: net present value; multiple-resource; computational experience; hierarchical-models; activity networks; general-class; branch; precedence; performance; complexity;References
No references listed on IDEASYou can help add them by filling out this form.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.Cited by:
This item has more than 25 citations. To prevent cluttering this page, these citations are listed on a separate page.
Lists
This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.Statistics
Access and download statisticsCorrections
When requesting a correction, please mention this item's handle: RePEc:ner:leuven:urn:hdl:123456789/101588For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Carl Demeyere).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.

