Advanced Search
MyIDEAS: Login to save this article or follow this journal

Scheduling a Project to Maximize Its Present Value: A Zero-One Programming Approach

Contents:

Author Info

  • Robert H. Doersch

    (Stanley Works Inc., Plantsville, Connecticut)

  • James H. Patterson

    (The Pennsylvania State University)

Registered author(s):

    Abstract

    A zero-one integer programming formulation of the project scheduling problem is reported which maximizes the discounted value of cash flows in a project when progress payments and cash outflows are made upon the completion of certain activities. While this problem has been treated previously, it has not been addressed in a manner which allows for the type of constraints treated in this paper. And while cash can be treated as any other resource in the noncash flow, resource-constrained version of this problem, the effects of cash inflows and outflows and the time sequencing alternatives for them allow for a different treatment of cash resources than has been previously reported.

    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.
    File URL: http://dx.doi.org/10.1287/mnsc.23.8.882
    Download Restriction: no

    Bibliographic Info

    Article provided by INFORMS in its journal Management Science.

    Volume (Year): 23 (1977)
    Issue (Month): 8 (April)
    Pages: 882-889

    as in new window
    Handle: RePEc:inm:ormnsc:v:23:y:1977:i:8:p:882-889

    Contact details of provider:
    Postal: 7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA
    Phone: +1-443-757-3500
    Fax: 443-757-3515
    Email:
    Web page: http://www.informs.org/
    More information through EDIRC

    Related research

    Keywords:

    References

    No references listed on IDEAS
    You 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.
    as in new window

    Cited by:
    1. Vanhoucke, Mario & Demeulemeester, Erik & Herroelen, Willy, 2003. "Progress payments in project scheduling problems," European Journal of Operational Research, Elsevier, vol. 148(3), pages 604-620, August.
    2. Mika, Marek & Waligora, Grzegorz & Weglarz, Jan, 2005. "Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models," European Journal of Operational Research, Elsevier, vol. 164(3), pages 639-668, August.
    3. Herroelen, Willy S. & Van Dommelen, Patrick & Demeulemeester, Erik L., 1997. "Project network models with discounted cash flows a guided tour through recent developments," European Journal of Operational Research, Elsevier, vol. 100(1), pages 97-121, July.
    4. He, Zhengwen & Liu, Renjing & Jia, Tao, 2012. "Metaheuristics for multi-mode capital-constrained project payment scheduling," European Journal of Operational Research, Elsevier, vol. 223(3), pages 605-613.
    5. Ulusoy, Gunduz & Ozdamar, Linet, 1996. "A framework for an interactive project scheduling system under limited resources," European Journal of Operational Research, Elsevier, vol. 90(2), pages 362-375, April.

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:23:y:1977:i:8:p:882-889. 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: (Mirko Janc).

    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.