LP relaxation-based solution algorithms for the multi-mode project scheduling with a non-renewable resource

2015-01-01
Azizoğlu, Meral
Pamir, Selin Kirbiyik
In this study, we consider a multi-mode resource allocation problem with a single non-renewable resource. We assume the resource is released at defined time points and at defined quantities. We also assume that the activity costs are charged once they are completed. Our aim is to minimise the project completion time. We formulate the problem as a pure integer programming model and show that it is strongly NP-hard. We find lower bounds by pure and mixed integer linear programming relaxations of the model and develop three heuristic procedures based on those relaxations. The results of our computational study have revealed the satisfactory performances of our lower bounds and heuristic procedures.
EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING

Suggestions

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 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...
Resource investment problem with time/resource trade-offs
Çolak, Erdem; Azizoğlu, Meral; Department of Industrial Engineering (2011)
In this study, we consider a resource investment problem with time/resource trade-offs in project environments. We assume each mode of an activity is characterized by its processing time and resource requirement and there is a single renewable resource. Our aim is to minimize the maximum resource usage, hence the total amount invested for the single resource. We formulate the problem as a mixed integer linear model and find optimal solutions for small sized problem instances. We propose several lower boundi...
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 ...
Discrete time/cost trade-off project scheduling with a nonrenewable resource
Kırbıyık, Selin; Azizoğlu, Meral; Çetinkaya, Ferda Can; Department of Industrial Engineering (2009)
In this thesis, we consider a discrete time/cost trade-off problem with a single nonrenewable resource. We assume the resource is released at some prespecified time points and at some prespecified quantities. We also assume that the costs due to the activities are incurred at their completions. Our aim is to minimize total project completion time. We formulate the problem as a pure integer programming model. We show that the problem is strongly NP-hard. We find lower bounds by pure linear programming and mi...
Citation Formats
M. Azizoğlu and S. K. Pamir, “LP relaxation-based solution algorithms for the multi-mode project scheduling with a non-renewable resource,” EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING, pp. 450–469, 2015, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/35618.