IDEAS home Printed from https://ideas.repec.org/a/ids/eujine/v9y2015i4p450-469.html
   My bibliography  Save this article

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

Author

Listed:
  • Meral Azizoglu
  • Ferda Can Çetinkaya
  • Selin Kırbıyık Pamir

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]

Suggested Citation

  • Meral Azizoglu & Ferda Can Çetinkaya & Selin Kırbıyık Pamir, 2015. "LP relaxation-based solution algorithms for the multi-mode project scheduling with a non-renewable resource," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 9(4), pages 450-469.
    • Handle: RePEc:ids:eujine:v:9:y:2015:i:4:p:450-469
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=70322
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:eujine:v:9:y:2015:i:4:p:450-469. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=210 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.