Next Article in Journal
Noise Reduction of Steel Cord Conveyor Belt Defect Electromagnetic Signal by Combined Use of Improved Wavelet and EMD
Next Article in Special Issue
A New Fuzzy Harmony Search Algorithm Using Fuzzy Logic for Dynamic Parameter Adaptation
Previous Article in Journal
Noncircular Sources-Based Sparse Representation Algorithm for Direction of Arrival Estimation in MIMO Radar with Mutual Coupling
Previous Article in Special Issue
A Multi-Objective Harmony Search Algorithm for Sustainable Design of Floating Settlements
Article Menu

Export Article

Open AccessArticle
Algorithms 2016, 9(4), 63; doi:10.3390/a9040063

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

Department of Marketing and Distribution Management, Nanya Institute of Technology, Taoyuan 32091, Taiwan
Department of Industrial Engineering and Management, Yuan Ze University, Taoyuan 32003, Taiwan
Innovation Center for Big Data and Digital Convergence, Yuan Ze University, Taoyuan 32003, Taiwan
Author to whom correspondence should be addressed.
Academic Editor: Henning Fernau
Received: 4 July 2016 / Revised: 6 September 2016 / Accepted: 16 September 2016 / Published: 24 September 2016
(This article belongs to the Special Issue Metaheuristic Algorithms in Optimization and Applications)
View Full-Text   |   Download PDF [1284 KB, uploaded 24 September 2016]   |  


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. View Full-Text
Keywords: MRCPSP/max; discrete Artificial Bee Colony (ABC); entropy; robust scheduling MRCPSP/max; discrete Artificial Bee Colony (ABC); entropy; robust scheduling

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Chen, A.H.-L.; Liang, Y.-C.; Padilla, J.D. A Practical and Robust Execution Time-Frame Procedure for the Multi-Mode Resource-Constrained Project Scheduling Problem with Minimal and Maximal Time Lags. Algorithms 2016, 9, 63.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top