The project coordinator's problem
A project coordinator has a set of activities with known durations and values which are available for scheduling within a given horizon. There may be both precedence and corequisite restrictions (two activities are corequisites if scheduling one implies the other must be scheduled). The project coordinator's problem is to select the activities to be scheduled, and their start times, so as to maximize the net value of the project when there is no penalty for failing to schedule an activity. An efficient solution procedure is developed and illustrated and several generalizations are discussed.
Volume (Year): 6 (1978)
Issue (Month): 4 ()
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
When requesting a correction, please mention this item's handle: RePEc:eee:jomega:v:6:y:1978:i:4:p:325-330. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If references are entirely missing, you can add them using this form.