IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v70y2019i3p403-419.html
   My bibliography  Save this article

Solving the FS-RCPSP with hyper-heuristics: A policy-driven approach

Author

Listed:
  • Yagub Alipouri
  • Mohammad Hassan Sebt
  • Abdollah Ardeshir
  • Weng Tat Chan

Abstract

In this paper, a problem in the area of scheduling, namely Fuzzy Stochastic Resource-Constrained Project Scheduling Problem (FS-RCPSP), is addressed. Like the original Resource-Constrained Project Scheduling Problem (RCPSP), the objective is to minimise the expected makespan of the project subject to precedence and resource constraints. However, due to mixed uncertainty comprising fuzziness and randomness in the estimates of activity durations, the makespan is a fuzzy stochastic number. Recognising both fuzziness and randomness in activity durations results in more robust schedules but the scheduling problem is harder to solve. A hyper-heuristic, named Self-adaptive Differential Evolution to Scheduling Policy (SADESP) is proposed to address this issue. SADESP has two key modules: (1) a module (policyEvolver) which evolves scheduling policy and (2) a dynamic scheduling procedure (dScheduler) which makes scheduling decisions using a particular scheduling policy. The performance of SADESP is benchmarked against CPLEX across an extensive set of 960 problems created with ProGen – a standardised problem generator for creating benchmark problems in scheduling. The results returned by SADESP for FS-RCPSP are very encouraging, both in terms of accuracy and computational performance.

Suggested Citation

  • Yagub Alipouri & Mohammad Hassan Sebt & Abdollah Ardeshir & Weng Tat Chan, 2019. "Solving the FS-RCPSP with hyper-heuristics: A policy-driven approach," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 70(3), pages 403-419, March.
    • Handle: RePEc:taf:tjorxx:v:70:y:2019:i:3:p:403-419
    DOI: 10.1080/01605682.2018.1441636
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2018.1441636
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2018.1441636?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    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:taf:tjorxx:v:70:y:2019:i:3:p:403-419. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    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.