Books and journals Case studies Expert Briefings Open Access
Advanced search

Modeling of the time-dependent multi-skilled RCPSP considering learning effect: An evolutionary solution approach

Amir Hossein Hosseinian (Islamic Azad University Tehran North Branch, Tehran, Iran)
Vahid Baradaran (Islamic Azad University Tehran North Branch, Tehran, Iran)
Mahdi Bashiri (Shahed University, Tehran, Iran)

Journal of Modelling in Management

ISSN: 1746-5664

Publication date: 10 May 2019

Abstract

Purpose

The purpose of this paper is to propose a new mixed-integer formulation for the time-dependent multi-skilled resource-constrained project scheduling problem (MSRCPSP/t) considering learning effect. The proposed model extends the basic form of the MSRCPSP by three concepts: workforces have different efficiencies, it is possible for workforces to improve their efficiencies by learning from more efficient workers and the availability of workforces and resource requests of activities are time-dependent. To spread dexterity from more efficient workforces to others, this study has integrated the concept of diffusion maximization in social networks into the proposed model. In this respect, the diffusion of dexterity is formulated based on the linear threshold model for a network of workforces who share common skills. The proposed model is bi-objective, aiming to minimize make-span and total costs of project, simultaneously.

Design/methodology/approach

The MSRCPSP is an non-deterministic polynomial-time hard (NP-hard) problem in the strong sense. Therefore, an improved version of the non-dominated sorting genetic algorithm II (IM-NSGA-II) is developed to optimize the make-span and total costs of project, concurrently. For the proposed algorithm, this paper has designed new genetic operators that help to spread dexterity among workforces. To validate the solutions obtained by the IM-NSGA-II, four other evolutionary algorithms – the classical NSGA-II, non-dominated ranked genetic algorithm, Pareto envelope-based selection algorithm II and strength Pareto evolutionary algorithm II – are used. All algorithms are calibrated via the Taguchi method.

Findings

Comprehensive numerical tests are conducted to evaluate the performance of the IM-NSGA-II in comparison with the other four methods in terms of convergence, diversity and computational time. The computational results reveal that the IM-NSGA-II outperforms the other methods in terms of most of the metrics. Besides, a sensitivity analysis is implemented to investigate the impact of learning on objective function values. The outputs show the significant impact of learning on objective function values.

Practical implications

The proposed model and algorithm can be used for scheduling activities of small- and large-size real-world projects.

Originality/value

Based on the previous studies reviewed in this paper, one of the research gaps is the MSRCPSP with time-dependent resource capacities and requests. Therefore, this paper proposes a multi-objective model for the MSRCPSP with time-dependent resource profiles. Besides, the evaluation of learning effect on efficiency of workforces has not been studied sufficiently in the literature. In this study, the effect of learning on efficiency of workforces has been considered. In the scarce number of proposed models with learning effect, the researchers have assumed that the efficiency of workforces increases as they spend more time on performing a skill. To the best of the authors’ knowledge, the effect of learning from more efficient co-workers has not been studied in the literature of the RCPSP. Therefore, in this research, the effect of learning from more efficient co-workers has been investigated. In addition, a modified version of the NSGA-II algorithm is developed to solve the model.

Keywords

  • Project management
  • Scheduling
  • Mathematical programming

Citation

Hosseinian, A.H., Baradaran, V. and Bashiri, M. (2019), "Modeling of the time-dependent multi-skilled RCPSP considering learning effect: An evolutionary solution approach", Journal of Modelling in Management, Vol. 14 No. 2, pp. 521-558. https://doi.org/10.1108/JM2-07-2018-0098

Download as .RIS

Publisher

:

Emerald Publishing Limited

Copyright © 2019, Emerald Publishing Limited

Please note you do not have access to teaching notes

You may be able to access teaching notes by logging in via Shibboleth, Open Athens or with your Emerald account.
Login
If you think you should have access to this content, click the button to contact our support team.
Contact us

To read the full version of this content please select one of the options below

You may be able to access this content by logging in via Shibboleth, Open Athens or with your Emerald account.
Login
To rent this content from Deepdyve, please click the button.
Rent from Deepdyve
If you think you should have access to this content, click the button to contact our support team.
Contact us
Emerald Publishing
  • Opens in new window
  • Opens in new window
  • Opens in new window
  • Opens in new window
© 2021 Emerald Publishing Limited

Services

  • Authors Opens in new window
  • Editors Opens in new window
  • Librarians Opens in new window
  • Researchers Opens in new window
  • Reviewers Opens in new window

About

  • About Emerald Opens in new window
  • Working for Emerald Opens in new window
  • Contact us Opens in new window
  • Publication sitemap

Policies and information

  • Privacy notice
  • Site policies
  • Modern Slavery Act Opens in new window
  • Chair of Trustees governance statement Opens in new window
  • COVID-19 policy Opens in new window
Manage cookies

We’re listening — tell us what you think

  • Something didn’t work…

    Report bugs here

  • All feedback is valuable

    Please share your general feedback

  • Member of Emerald Engage?

    You can join in the discussion by joining the community or logging in here.
    You can also find out more about Emerald Engage.

Join us on our journey

  • Platform update page

    Visit emeraldpublishing.com/platformupdate to discover the latest news and updates

  • Questions & More Information

    Answers to the most commonly asked questions here