A practical and robust execution time-frame procedure for the multi-mode resource-constrained project scheduling problem with minimal and maximal time lags
type: Item
instance of: scholarly article
title: A practical and robust execution time-frame procedure for the multi-mode resource-constrained project scheduling problem with minimal and maximal time lags
zbMATH Open document ID: 1461.90041
author: Angela Hsiang-Ling Chen
author: Yun-Chia Liang
author: Jose David Padilla
published in: Algorithms
publication date: 2019-03-26T00:00:00Z
review text: Summary: Modeling and optimizing organizational processes, such as the one represented by the Resource-Constrained Project Scheduling Problem (RCPSP), improve outcomes. Based on assumptions and simplification, this model tackles the allocation of resources so that organizations can continue to generate profits and reinvest in future growth. Nonetheless, despite all of the research dedicated to solving the RCPSP and its multi-mode variations, there is no standardized procedure that can guide project management practitioners in their scheduling tasks. This is mainly because many of the proposed approaches are either based on unrealistic/oversimplified scenarios or they propose solution procedures not easily applicable or even feasible in real-life situations. In this study, we solve a more true-to-life and complex model, Multimode RCPSP with minimal and maximal time lags (MRCPSP/max). The complexity of the model solved is presented, and the practicality of the proposed approach is justified depending on only information that is available for every project regardless of its industrial context. The results confirm that it is possible to determine a robust makespan and to calculate an execution time-frame with gaps lower than 11\% between their lower and upper bounds. In addition, in many instances, the solved lower bound obtained was equal to the best-known optimum.
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B50
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7042372
zbMATH Keywords: MRCPSP/max
zbMATH Keywords: discrete artificial bee colony (ABC)
zbMATH Keywords: entropy
zbMATH Keywords: robust scheduling
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.3390/a9040063
OpenAlex ID: W2523761909
cites work: Scheduling subject to resource constraints: Classification and complexity
cites work: Q4166568
cites work: The resource constrained project scheduling problem with multiple crashable modes: An exact solution method
cites work: A branch-and-cut procedure for the multimode resource-constrained project-scheduling problem
cites work: Resource-constrained project scheduling: A heuristic for the multi-mode case
cites work: A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags
cites work: Q3426435
cites work: A mathematical model for the multi-mode resource-constrained project scheduling problem with mode dependent time lags
cites work: On project scheduling with irregular starting time costs
cites work: Solving Project Scheduling Problems by Minimum Cut Computations
cites work: Project scheduling under time dependent costs -- a branch and bound algorithm
cites work: Maximizing the net present value of a project under resource constraints using a Lagrangian relaxation based heuristic with tight upper bounds
cites work: Knowledge integration using problem spaces: A study in resource-constrained project scheduling
cites work: An equitable approach to the payment scheduling problem in project management
cites work: Maximizing the net present value of a project with linear time-dependent cash flows
cites work: Project Contracts and Payment Schedules: The Client's Problem
cites work: Simulated annealing for multi-mode resource-constrained project scheduling
cites work: A self-adapting genetic algorithm for project scheduling under resource constraints
cites work: A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems
cites work: A hybrid scatter search for the discrete time/resource trade-off problem in project scheduling
cites work: Solving a comprehensive model for multiobjective project portfolio selection
cites work: A neurogenetic approach for the resource-constrained project scheduling problem
cites work: Differential evolution for solving multi-mode resource-constrained project scheduling problems
cites work: An effective shuffled frog-leaping algorithm for resource-constrained project scheduling problem
cites work: A new heuristic for resource-constrained project scheduling in stochastic networks using critical chain concept
cites work: Q2769922
cites work: A double genetic algorithm for the MRCPSP/max
cites work: Project scheduling. A research handbook.
cites work: Heuristic Performance and Network/Resource Characteristics in Resource-constrained Project Scheduling
DOI: 10.3390/A9040063
description: scientific article; zbMATH DE number 7042372