An Entropy-Based Upper Bound Methodology for Robust Predictive Multi-Mode RCPSP Schedules
AbstractProjects are an important part of our activities and regardless of their magnitude, scheduling is at the very core of every project. In an ideal world makespan minimization, which is the most commonly sought objective, would give us an advantage. However, every time we execute a project we have to deal with uncertainty; part of it coming from known sources and part remaining unknown until it affects us. For this reason, it is much more practical to focus on making our schedules robust, capable of handling uncertainty, and even to determine a range in which the project could be completed. In this paper we focus on an approach to determine such a range for the Multi-mode Resource Constrained Project Scheduling Problem (MRCPSP), a widely researched, NP-complete problem, but without adding any subjective considerations to its estimation. We do this by using a concept well known in the domain of thermodynamics, entropy and a three-stage approach. First we use Artificial Bee Colony (ABC)—an effective and powerful meta-heuristic—to determine a schedule with minimized makespan which serves as a lower bound. The second stage defines buffer times and creates an upper bound makespan using an entropy function, with the advantage over other methods that it only considers elements which are inherent to the schedule itself and does not introduce any subjectivity to the buffer time generation. In the last stage, we use the ABC algorithm with an objective function that seeks to maximize robustness while staying within the makespan boundaries defined previously and in some cases even below the lower boundary. We evaluate our approach with two different benchmarks sets: when using the PSPLIB for the MRCPSP benchmark set, the computational results indicate that it is possible to generate robust schedules which generally result in an increase of less than 10% of the best known solutions while increasing the robustness in at least 20% for practically every benchmark set. And, in an attempt to solve larger instances with 50 or 100 activities, we also used the MRCPSP/max benchmark sets, where the increase of the makespan is approximately 35% with respect to the best known solutions at the same time as with a 20% increase in robustness. View Full-Text
Share & Cite This Article
Chen, A.H.-L.; Liang, Y.-C.; Padilla, J.D. An Entropy-Based Upper Bound Methodology for Robust Predictive Multi-Mode RCPSP Schedules. Entropy 2014, 16, 5032-5067.
Chen AH-L, Liang Y-C, Padilla JD. An Entropy-Based Upper Bound Methodology for Robust Predictive Multi-Mode RCPSP Schedules. Entropy. 2014; 16(9):5032-5067.Chicago/Turabian Style
Chen, Angela H.-L.; Liang, Yun-Chia; Padilla, Jose D. 2014. "An Entropy-Based Upper Bound Methodology for Robust Predictive Multi-Mode RCPSP Schedules." Entropy 16, no. 9: 5032-5067.