Show/Hide Menu
Hide/Show Apps
anonymousUser
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Frequently Asked Questions
Frequently Asked Questions
Communities & Collections
Communities & Collections
LP relaxation-based solution algorithms for the multi-mode project scheduling with a non-renewable resource
Date
2015-01-01
Author
Azizoğlu, Meral
ÇETİNKAYA, FERDA CAN
Pamir, Selin Kirbiyik
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
6
views
0
downloads
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.
Subject Keywords
Project scheduling
,
Multi-modes
,
Non-renewable resource
,
Integer programming
,
Linear programming relaxation
,
Heuristics
URI
https://hdl.handle.net/11511/35618
Journal
EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING
DOI
https://doi.org/10.1504/ejie.2015.070322
Collections
Department of Industrial Engineering, Article