IDEAS home Printed from https://ideas.repec.org/a/ids/ijisen/v34y2020i2p145-164.html
   My bibliography  Save this article

A general variable neighbourhood search for multi-skill resource-constrained project scheduling problem with step-deterioration

Author

Listed:
  • Huafeng Dai
  • Wenming Cheng
  • Wucheng Yang
  • Yupu Wang

Abstract

This paper proposes a general variable neighbourhood search approach (GVNS) for solving the multi-skill resource constrained project scheduling problem (MS-RCPSP) under step-deterioration aiming to minimise maximum completion time. To assess the performance of the proposed GVNS, integrating five neighbourhood structures and a disturbance step, computational experiments are carried out on two sets instances. One group takes no account of deterioration where the proposed GVNS achieved highly performance compared with the state-of-the-art algorithms in the literature, and the other group of experiments on modified dataset considering the step-deterioration effect also demonstrates the capability of the GVNS to find high quality solutions.

Suggested Citation

  • Huafeng Dai & Wenming Cheng & Wucheng Yang & Yupu Wang, 2020. "A general variable neighbourhood search for multi-skill resource-constrained project scheduling problem with step-deterioration," International Journal of Industrial and Systems Engineering, Inderscience Enterprises Ltd, vol. 34(2), pages 145-164.
    • Handle: RePEc:ids:ijisen:v:34:y:2020:i:2:p:145-164
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=105288
    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 & Hanyu Zhu & Linwen Zheng & Fang Xie, 2024. "Software project scheduling under activity duration uncertainty," Annals of Operations Research, Springer, vol. 338(1), pages 477-512, July.

    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:ijisen:v:34:y:2020:i:2:p:145-164. 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=188 .

    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.