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

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 t...

Full description

Saved in:
Bibliographic Details
Published inThe Journal of the Operational Research Society Vol. 70; no. 3; pp. 403 - 419
Main Authors Alipouri, Yagub, Sebt, Mohammad Hassan, Ardeshir, Abdollah, Chan, Weng Tat
Format Journal Article
LanguageEnglish
Published Taylor & Francis 04.03.2019
Taylor & Francis, Ltd
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary: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.
ISSN:0160-5682
1476-9360
DOI:10.1080/01605682.2018.1441636