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

2020-04-01
Altıntaş, Cansu
Azizoğlu, Meral
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.
INTERNATIONAL JOURNAL OF INFORMATION TECHNOLOGY PROJECT MANAGEMENT

Suggestions

A Resource Constrained Project Scheduling Problem With Multi-Modes
Altintas, Cansu; Azizoğlu, Meral (2020-01-01)
In this study, the authors consider a project scheduling problem with a single non-renewable resource. The authors assume that the resource is released at scheduled times and specified quantities and the resource is consumed at activity completion. The activities can be processed at different modes where a mode is defined by a processing time and a resource requirement amount. The problem is to select the modes and timings of the activities so as to minimize the project completion time. The authors give a m...
A Multi-mode project scheduling problem with a single nonrenewable resource
Altıntaş, Cansu; Azizoğlu, Meral; Department of Industrial Engineering (2017)
In this thesis, we consider a multi-mode project scheduling problem with a single nonrenewable resource. We assume that the resource is released in pre-specified times at pre-specified quantities and the resource is consumed at activity completions. The activities can be processed at different modes where a mode is defined by a processing time and a resource requirement amount. Our problem is to select the modes and timings of the activities so as to minimize the project completion time. We develop a mixed ...
Multi-Mode Resource Constrained Project Scheduling Problem With a Single Nonrenewable Resource
Altıntaş, Cansu; Azizoğlu, Meral (2016-10-06)
In this study, we consider a project scheduling problem with a single nonrenewable resource. We assume that the resource is released in scheduled times at specified quantities and the resource is consumed at activity completions. The activities can be processed at different modes where a mode is defined by a processing time and a resource requirement amount. Our problem is to select the modes and timings of the activities so as to minimize the project completion time. We give an efficient mathematical formu...
A genetic algorithm for the resource constrained project scheduling problem
Özleyen, Erdem; Sönmez, Rifat; Department of Civil Engineering (2011)
The resource-constrained project scheduling problem (RCPSP) aims to find a schedule of minimum makespan by starting each activity such that resource constraints and precedence constraints are respected. However, as the problem is NP-hard (Non-Deterministic Polynomial-Time Hard) in the strong sense, the performance of exact procedures is limited and can only solve small-sized project networks. In this study a genetic algorithm is proposed for the RCPSP. The proposed genetic algorithm (GA) aims to find near-o...
A stochastic approach for load scheduling of cogeneration plants
Doğan, Osman Tufan; Yeşin, Ahmet Orhan; Department of Mechanical Engineering (2010)
In this thesis, load scheduling problem for cogeneration plants is interpreted in the context of stochastic programming. Cogeneration (CHP) is an important technology in energy supply of many countries. Cogeneration plants are designed and operated to cover the requested time varying demands in heat and power. Load scheduling of cogeneration plants represents a multidimensional optimization problem, where heat and electricity demands, operational parameters and associated costs exhibit uncertain behavior. C...
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, pp. 1–14, 2020, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/36948.