A Branch and Bound Algorithm for a Multi-Mode Project Scheduling Problem With a Single Non-Renewable Resource
Cansu Altintas and
Meral Azizoglu
Additional contact information
Cansu Altintas: Middle East Technical University, Turkey
Meral Azizoglu: Middle East Technical University, Turkey
International Journal of Information Technology Project Management (IJITPM), 2020, vol. 11, issue 2, 1-14
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.
Date: 2020
References: Add references at CitEc
Citations: View citations in EconPapers (1) Track citations by RSS feed
Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 18/IJITPM.2020040101 (application/pdf)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:igg:jitpm0:v:11:y:2020:i:2:p:1-14
Access Statistics for this article
International Journal of Information Technology Project Management (IJITPM) is currently edited by John Wang
More articles in International Journal of Information Technology Project Management (IJITPM) from IGI Global
Bibliographic data for series maintained by Journal Editor (journaleditor@igi-global.com).