IDEAS home Printed from https://ideas.repec.org/a/igg/jitpm0/v11y2020i2p1-14.html
   My bibliography  Save this article

A Branch and Bound Algorithm for a Multi-Mode Project Scheduling Problem With a Single Non-Renewable Resource

Author

Listed:
  • Cansu Altintas

    (Middle East Technical University, Turkey)

  • Meral Azizoglu

    (Middle East Technical University, Turkey)

Abstract

In this paper, a project scheduling problem with multi-modes and a single non-renewable resource is considered. The resource is released in pre-specified times at pre-specified quantities. An activity can be executed at different modes where a mode is defined by a processing time and a resource requirement amount. The objective is to minimize the project completion time. A branch and bound algorithm that enumerates the partial solutions based on the mode assignment decisions is presented. The results of the experiments have revealed that the branch and bound algorithm can solve problem instances with up to 100 activities in reasonable times.

Suggested Citation

  • Cansu Altintas & Meral Azizoglu, 2020. "A Branch and Bound Algorithm for a Multi-Mode Project Scheduling Problem With a Single Non-Renewable Resource," International Journal of Information Technology Project Management (IJITPM), IGI Global, vol. 11(2), pages 1-14, April.
    • Handle: RePEc:igg:jitpm0:v:11:y:2020:i:2:p:1-14
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJITPM.2020040101
    Download Restriction: no
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. José Romualdo Costa Filho & Renato Penha & Luciano Ferreira Silva & Flavio Santino Bizarrias, 2022. "Competencies for Managing Activities in Agile Projects," Global Journal of Flexible Systems Management, Springer;Global Institute of Flexible Systems Management, vol. 23(4), pages 431-452, December.

    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:igg:jitpm0:v:11:y:2020:i:2:p:1-14. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.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.