IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v64y2013i10p1474-1484.html
   My bibliography  Save this article

Branch and bound based solution algorithms for the budget constrained discrete time/cost trade-off problem

Author

Listed:
  • G Değirmenci

    (University of Pittsburgh, Pittsburgh, USA)

  • M Azizoğlu

    (Middle East Technical University, Ankara, Turkey)

Abstract

The time/cost trade-off models in project management aim to reduce the project completion time by putting extra resources on activity durations. The budget problem in discrete time/cost trade-off scheduling selects a time/cost mode for each activity so as to minimize the project completion time without exceeding the available budget. There may be alternative modes that solve the budget problem optimally and each solution may have a different total cost value. In this study we consider the budget problem and aim to find the minimum cost solution among the minimum project completion time solutions. We analyse the structure of the problem together with its linear programming relaxation and derive some mechanisms for reducing the problem size. We solve the reduced problem by branch and bound based optimization and heuristic algorithms. We find that our branch and bound algorithm finds optimal solutions for medium-sized problem instances in reasonable times and the heuristic algorithms produce high quality solutions very quickly.

Suggested Citation

  • G Değirmenci & M Azizoğlu, 2013. "Branch and bound based solution algorithms for the budget constrained discrete time/cost trade-off problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 64(10), pages 1474-1484, October.
    • Handle: RePEc:pal:jorsoc:v:64:y:2013:i:10:p:1474-1484
    as

    Download full text from publisher

    File URL: http://www.palgrave-journals.com/jors/journal/v64/n10/pdf/jors201214a.pdf
    File Function: Link to full text PDF
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: http://www.palgrave-journals.com/jors/journal/v64/n10/full/jors201214a.html
    File Function: Link to full text HTML
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    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:pal:jorsoc:v:64:y:2013:i:10:p:1474-1484. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    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.