IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v64y2013i7p1071-1078.html
   My bibliography  Save this article

A path-relinking metaheuristic for the resource levelling problem

Author

Listed:
  • M Ranjbar

    (Ferdowsi University of Mashhad, Iran)

Abstract

This paper deals with project scheduling problem with resource levelling objective function where precedence relations among activities are prescribed. We develop a dedicated path-relinking metaheuristic algorithm to tackle this problem. Computational results on randomly generated test sets indicate the developed procedure is efficient and outperforms the best available metaheuristic algorithms in the literature.

Suggested Citation

  • M Ranjbar, 2013. "A path-relinking metaheuristic for the resource levelling problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 64(7), pages 1071-1078, July.
    • Handle: RePEc:pal:jorsoc:v:64:y:2013:i:7:p:1071-1078
    as

    Download full text from publisher

    File URL: http://www.palgrave-journals.com/jors/journal/v64/n7/pdf/jors2012119a.pdf
    File Function: Link to full text PDF
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: http://www.palgrave-journals.com/jors/journal/v64/n7/full/jors2012119a.html
    File Function: Link to full text HTML
    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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Hongbo Li & Erik Demeulemeester, 2016. "A genetic algorithm for the robust resource leveling problem," Journal of Scheduling, Springer, vol. 19(1), pages 43-60, February.

    More about this item

    Statistics

    Access and download statistics

    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:pal:jorsoc:v:64:y:2013:i:7:p:1071-1078. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    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.