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

Date

2020-04-01

Author

Altıntaş, Cansu
Azizoğlu, Meral

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

35
views

0
downloads

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.

Subject Keywords

Branch and Bound Algorithm, Project Scheduling, Non-Renewable Resource, Multi-Modes

URI

https://hdl.handle.net/11511/36948

Journal

INTERNATIONAL JOURNAL OF INFORMATION TECHNOLOGY PROJECT MANAGEMENT

DOI

https://doi.org/10.4018/ijitpm.2020040101

Collections

Department of Industrial Engineering, Article

Citation Formats

C. Altıntaş and M. Azizoğlu, “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, vol. 11, no. 2, pp. 1–14, 2020, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/36948.