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

Meral Azizoglu, Ferda Can Çetinkaya and Selin Kırbıyık Pamir

European Journal of Industrial Engineering, 2015, vol. 9, issue 4, 450-469

Abstract: 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. [Received 7 December 2011; Revised 13 April 2013; Revised 4 February 2014; Accepted 11 April 2014]

Keywords: project scheduling; multi-mode resource allocation; non-renewable resources; integer programming; linear programming relaxation; heuristics; project completion time. (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=70322 (text/html)
Access to full text is restricted to subscribers.

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:ids:eujine:v:9:y:2015:i:4:p:450-469

Access Statistics for this article

More articles in European Journal of Industrial Engineering from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().