IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v24y2015i1p1-16.html
   My bibliography  Save this article

Using a meta-heuristic algorithm for solving the multi-mode resource-constrained project scheduling problem

Author

Listed:
  • J. Rezaeian
  • Farham Soleimani
  • Somayeh Mohaselafshary
  • Ali Arab

Abstract

Resource-constrained project scheduling problem (RCPSP) is one of the most important problems in the context of project scheduling. It consists of activities that must be scheduled subject to precedence and resource constraints such that the makespan is minimised. Robustness is an objective that recently has been noticed. Robustness of the scheduling means that if some activities take more time than the estimated of the scheduling phase, project finish date will not change without any cost. In this paper, a bi-objective single mode RCPSP is expanded to the multi-mode resource-constrained project scheduling problem (MRCPSP) with robustness and makespan criteria. Taking these two objectives in the MRCPSP as a bi-objective problem and using metaheuristic algorithms to solve it has not been studied until now. A new bi-objective mathematical model for the problem is presented. The problem formed in this way is NP-hard, so we apply an evolutionary algorithm named sub-population genetic algorithm (SPGA) to find Pareto solutions. Standard sets of instances from the project scheduling problem library (PSPLIB) are used and solved by the proposed algorithms to show the efficiency of our algorithm to solve the problem.

Suggested Citation

  • J. Rezaeian & Farham Soleimani & Somayeh Mohaselafshary & Ali Arab, 2015. "Using a meta-heuristic algorithm for solving the multi-mode resource-constrained project scheduling problem," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 24(1), pages 1-16.
    • Handle: RePEc:ids:ijores:v:24:y:2015:i:1:p:1-16
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=70859
    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:ijores:v:24:y:2015:i:1:p:1-16. 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=170 .

    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.