IDEAS home Printed from https://ideas.repec.org/a/taf/reroxx/v23y2010i4p22-36.html
   My bibliography  Save this article

Cost Optimization of Time Schedules for Project Management

Author

Listed:
  • Uroš Klanšek
  • Mirko Pšunder

Abstract

The paper presents the cost optimization of the time schedules for project management. The nonlinear programming (NLP) model for the cost optimization of the time schedules under the generalized precedence relations between the project activities was developed and applied. The existing NLP optimization models have focused on the cost optimal solution of the project scheduling problems which include simplifying assumptions regarding the precedence relationships among the project activities. In this way, this research work aims to propose the NLP optimization model for making optimal time-cost decisions applicable to actual projects in project management. The generalized reduced-gradient method was used for the NLP optimization. The obtained results include the minimum total cost project schedules and the optimal project time-cost curves. The proposed optimization approach enables the insight into the interdependence between the project duration and the total project cost. The decision-maker can more effectively estimate the effect of the project deadline on a total project cost before the submission of a tender. An application example and an example of the time-cost trade-off analysis are presented in the paper to demonstrate the advantages of the proposed approach.

Suggested Citation

  • Uroš Klanšek & Mirko Pšunder, 2010. "Cost Optimization of Time Schedules for Project Management," Economic Research-Ekonomska Istraživanja, Taylor & Francis Journals, vol. 23(4), pages 22-36, January.
  • Handle: RePEc:taf:reroxx:v:23:y:2010:i:4:p:22-36
    DOI: 10.1080/1331677X.2010.11517431
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/1331677X.2010.11517431
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/1331677X.2010.11517431?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:reroxx:v:23:y:2010:i:4:p:22-36. See general information about how to correct material in RePEc.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/rero .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.