A Practical and Robust Execution Time-Frame Procedure for the Multi-Mode Resource-Constrained Project Scheduling Problem with Minimal and Maximal Time Lags

Angela Chen,Yun-Chia Liang,Jose Padilla

doi:10.3390/a9040063

Angela Chen, Yun-Chia Liang + Show 1 more

Open Access

https://doi.org/10.3390/a9040063

Copy DOI

Journal: Algorithms	Publication Date: Sep 24, 2016
Citations: 39	License type: CC BY 4.0

Affiliation: Nanya Technology (Taiwan), Yuan Ze University

Abstract

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.

Highlights

The main objective of researchers should be to develop methods that expand the industrial state-of-the-art in order to increase productivity, reduce costs or overall improve the performance measures
The sole point of comparison is against the best-known optima, and the results are reported based on the deviation against these Best-Known Optima (BKO)
M*, where M* represents the reference makespan when comparing the results of Stage 1 and Stage 3 (M* can be either a confirmed optimal or the Best-Known Makespan), and Ms denotes the makespan of the current stage

Summary

Introduction

The main objective of researchers should be to develop methods that expand the industrial state-of-the-art in order to increase productivity, reduce costs or overall improve the performance measures. These methods must be theoretically possible based on models, but must be robust, practical and easy to implement for practitioners. This paper examines one such example, the Resource-Constrained Project Scheduling Problem (RCPSP), which is found in practically every industry and has long been a focus of interest among the operations research community. Despite the high level of interest, no standard framework has emerged to guide practitioners in creating a project schedule that allocates limited resources in such a way as to:

Objectives

Methods

Results

Conclusion