Mode-Based versus Activity-Based Search for a Nonredundant Resolution of the Multimode Resource-Constrained Project Scheduling Problem

[EN] This paper addresses an energy-based extension of the Multimode Resource-Constrained Project Scheduling Problem (MRCPSP) called MRCPSP-ENERGY. This extension considers the energy consumption as an additional resource that leads to different execution modes (and durations) of the activities. Consequently, different schedules can be obtained. The objective is to maximize the efficiency of the project, which takes into account the minimization of both makespan and energy consumption. This is a well-known NP-hard problem, such that the application of metaheuristic techniques is necessary to address real-size problems in a reasonable time. This paper shows that the Activity List representation, commonly used in metaheuristics, can lead to obtaining many redundant solutions, that is, solutions that have different representations but are in fact the same. This is a serious disadvantage for a search procedure. We propose a genetic algorithm(GA) for solving the MRCPSP-ENERGY, trying to avoid redundant solutions by focusing the search on the execution modes, by using the Mode List representation. The proposed GA is evaluated on different instances of the PSPLIB-ENERGY library and compared to the results obtained by both exact methods and approximate methods reported in the literature. This library is an extension of the well-known PSPLIB library, which contains MRCPSP-ENERGY test cases.This paper has been partially supported by the Spanish Research Projects TIN2013-46511-C2-1-P and TIN2016-80856-R.Morillo-Torres, D.; Barber, F.; Salido, MA. (2017). Mode-Based versus Activity-Based Search for a Nonredundant Resolution of the Multimode Resource-Constrained Project Scheduling Problem. Mathematical Problems in Engineering. 2017:1-15. https://doi.org/10.1155/2017/4627856S1152017Mouzon, G., Yildirim, M. B., & Twomey, J. (2007). Operational methods for minimization of energy consumption of manufacturing equipment. International Journal of Production Research, 45(18-19), 4247-4271. doi:10.1080/00207540701450013Hartmann, S., & Sprecher, A. (1996). A note on «hierarchical models for multi-project planning and scheduling». European Journal of Operational Research, 94(2), 377-383. doi:10.1016/0377-2217(95)00158-1Christofides, N., Alvarez-Valdes, R., & Tamarit, J. M. (1987). Project scheduling with resource constraints: A branch and bound approach. European Journal of Operational Research, 29(3), 262-273. doi:10.1016/0377-2217(87)90240-2Zhu, G., Bard, J. F., & Yu, G. (2006). A Branch-and-Cut Procedure for the Multimode Resource-Constrained Project-Scheduling Problem. INFORMS Journal on Computing, 18(3), 377-390. doi:10.1287/ijoc.1040.0121Kolisch, R., & Hartmann, S. (1999). Heuristic Algorithms for the Resource-Constrained Project Scheduling Problem: Classification and Computational Analysis. International Series in Operations Research & Management Science, 147-178. doi:10.1007/978-1-4615-5533-9_7Józefowska, J., Mika, M., Różycki, R., Waligóra, G., & Węglarz, J. (2001). Annals of Operations Research, 102(1/4), 137-155. doi:10.1023/a:1010954031930Bouleimen, K., & Lecocq, H. (2003). A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version. European Journal of Operational Research, 149(2), 268-281. doi:10.1016/s0377-2217(02)00761-0Alcaraz, J., Maroto, C., & Ruiz, R. (2003). Solving the Multi-Mode Resource-Constrained Project Scheduling Problem with genetic algorithms. Journal of the Operational Research Society, 54(6), 614-626. doi:10.1057/palgrave.jors.2601563Zhang, H., Tam, C. M., & Li, H. (2006). Multimode Project Scheduling Based on Particle Swarm Optimization. Computer-Aided Civil and Infrastructure Engineering, 21(2), 93-103. doi:10.1111/j.1467-8667.2005.00420.xJarboui, B., Damak, N., Siarry, P., & Rebai, A. (2008). A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems. Applied Mathematics and Computation, 195(1), 299-308. doi:10.1016/j.amc.2007.04.096Li, H., & Zhang, H. (2013). Ant colony optimization-based multi-mode scheduling under renewable and nonrenewable resource constraints. Automation in Construction, 35, 431-438. doi:10.1016/j.autcon.2013.05.030Lova, A., Tormos, P., Cervantes, M., & Barber, F. (2009). An efficient hybrid genetic algorithm for scheduling projects with resource constraints and multiple execution modes. International Journal of Production Economics, 117(2), 302-316. doi:10.1016/j.ijpe.2008.11.002Peteghem, V. V., & Vanhoucke, M. (2010). A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem. European Journal of Operational Research, 201(2), 409-418. doi:10.1016/j.ejor.2009.03.034Węglarz, J., Józefowska, J., Mika, M., & Waligóra, G. (2011). Project scheduling with finite or infinite number of activity processing modes – A survey. European Journal of Operational Research, 208(3), 177-205. doi:10.1016/j.ejor.2010.03.037Kolisch, R., & Hartmann, S. (2006). Experimental investigation of heuristics for resource-constrained project scheduling: An update. European Journal of Operational Research, 174(1), 23-37. doi:10.1016/j.ejor.2005.01.065Debels, D., De Reyck, B., Leus, R., & Vanhoucke, M. (2006). A hybrid scatter search/electromagnetism meta-heuristic for project scheduling. European Journal of Operational Research, 169(2), 638-653. doi:10.1016/j.ejor.2004.08.020Paraskevopoulos, D. C., Tarantilis, C. D., & Ioannou, G. (2012). Solving project scheduling problems with resource constraints via an event list-based evolutionary algorithm. Expert Systems with Applications, 39(4), 3983-3994. doi:10.1016/j.eswa.2011.09.062Drexl, A. (1991). Scheduling of Project Networks by Job Assignment. Management Science, 37(12), 1590-1602. doi:10.1287/mnsc.37.12.1590BOCTOR, F. F. (1996). Resource-constrained project scheduling by simulated annealing. International Journal of Production Research, 34(8), 2335-2351. doi:10.1080/0020754960890502

Pre-emptive resource-constrained multimode project scheduling using genetic algorithm: a dynamic forward approach

Purpose: The issue resource over-allocating is a big concern for project engineers in the process of scheduling project activities. Resource over-allocating drawback is frequently seen after scheduling of a project in practice which causes a schedule to be useless. Modifying an over-allocated schedule is very complicated and needs a lot of efforts and time. In this paper, a new and fast tracking method is proposed to schedule large scale projects which can help project engineers to schedule the project rapidly and with more confidence. Design/methodology/approach: In this article, a forward approach for maximizing net present value (NPV) in multi-mode resource constrained project scheduling problem while assuming discounted positive cash flows (MRCPSP-DCF) is proposed. The progress payment method is used and all resources are considered as pre-emptible. The proposed approach maximizes NPV using unscheduled resources through resource calendar in forward mode. For this purpose, a Genetic Algorithm is applied to solve. Findings: The findings show that the proposed method is an effective way to maximize NPV in MRCPSP-DCF problems while activity splitting is allowed. The proposed algorithm is very fast and can schedule experimental cases with 1000 variables and 100 resources in few seconds. The results are then compared with branch and bound method and simulated annealing algorithm and it is found the proposed genetic algorithm can provide results with better quality. Then algorithm is then applied for scheduling a hospital in practice. Originality/value: The method can be used alone or as a macro in Microsoft Office Project® Software to schedule MRCPSP-DCF problems or to modify resource over-allocated activities after scheduling a project. This can help project engineers to schedule project activities rapidly with more accuracy in practice.Peer Reviewe

The Project Scheduling Problem with Non-Deterministic Activities Duration: A Literature Review

Purpose: The goal of this article is to provide an extensive literature review of the models and solution procedures proposed by many researchers interested on the Project Scheduling Problem with nondeterministic activities duration. Design/methodology/approach: This paper presents an exhaustive literature review, identifying the existing models where the activities duration were taken as uncertain or random parameters. In order to get published articles since 1996, was employed the Scopus database. The articles were selected on the basis of reviews of abstracts, methodologies, and conclusions. The results were classified according to following characteristics: year of publication, mathematical representation of the activities duration, solution techniques applied, and type of problem solved. Findings: Genetic Algorithms (GA) was pointed out as the main solution technique employed by researchers, and the Resource-Constrained Project Scheduling Problem (RCPSP) as the most studied type of problem. On the other hand, the application of new solution techniques, and the possibility of incorporating traditional methods into new PSP variants was presented as research trends. Originality/value: This literature review contents not only a descriptive analysis of the published articles but also a statistical information section in order to examine the state of the research activity carried out in relation to the Project Scheduling Problem with non-deterministic activities duration.Peer Reviewe

Welcome to OR&S! Where students, academics and professionals come together

In this manuscript, an overview is given of the activities done at the Operations Research and Scheduling (OR&S) research group of the faculty of Economics and Business Administration of Ghent University. Unlike the book published by [1] that gives a summary of all academic and professional activities done in the field of Project Management in collaboration with the OR&S group, the focus of the current manuscript lies on academic publications and the integration of these published results in teaching activities. An overview is given of the publications from the very beginning till today, and some of the topics that have led to publications are discussed in somewhat more detail. Moreover, it is shown how the research results have been used in the classroom to actively involve students in our research activities

Railway scheduling reduces the expected project makespan.

The Critical Chain Scheduling and Buffer Management (CC/BM) methodology, proposed by Goldratt (1997), introduced the concepts of feeding buffers, project buffers and resource buffers as well as the roadrunner mentality. This last concept, in which activities are started as soon as possible, was introduced in order to speed up projects by taking advantage of predecessors finishing early. Later on, the railway scheduling concept of never starting activities earlier than planned was introduced as a way to increase the stability of the project, typically at the cost of an increase in the expected project makespan. In this paper, we will indicate a realistic situation in which railway scheduling improves both the stability and the expected project makespan over roadrunner scheduling.Railway scheduling; Roadrunner scheduling; Feeding buffer; Priority list; Resource availability;

Accelerated Particle Swarm Optimization and Support Vector Machine for Business Optimization and Applications

Business optimization is becoming increasingly important because all business activities aim to maximize the profit and performance of products and services, under limited resources and appropriate constraints. Recent developments in support vector machine and metaheuristics show many advantages of these techniques. In particular, particle swarm optimization is now widely used in solving tough optimization problems. In this paper, we use a combination of a recently developed Accelerated PSO and a nonlinear support vector machine to form a framework for solving business optimization problems. We first apply the proposed APSO-SVM to production optimization, and then use it for income prediction and project scheduling. We also carry out some parametric studies and discuss the advantages of the proposed metaheuristic SVM.Comment: 12 page

Resource dedication problem in a multi-project environment

There can be different approaches to the management of resources within the context of multi-project scheduling problems. In general, approaches to multiproject scheduling problems consider the resources as a pool shared by all projects. On the other hand, when projects are distributed geographically or sharing resources between projects is not preferred, then this resource sharing policy may not be feasible. In such cases, the resources must be dedicated to individual projects throughout the project durations. This multi-project problem environment is defined here as the resource dedication problem (RDP). RDP is defined as the optimal dedication of resource capacities to different projects within the overall limits of the resources and with the objective of minimizing a predetermined objective function. The projects involved are multi-mode resource constrained project scheduling problems with finish to start zero time lag and non-preemptive activities and limited renewable and nonrenewable resources. Here, the characterization of RDP, its mathematical formulation and two different solution methodologies are presented. The first solution approach is a genetic algorithm employing a new improvement move called combinatorial auction for RDP, which is based on preferences of projects for resources. Two different methods for calculating the projects’ preferences based on linear and Lagrangian relaxation are proposed. The second solution approach is a Lagrangian relaxation based heuristic employing subgradient optimization. Numerical studies demonstrate that the proposed approaches are powerful methods for solving this problem

A hybrid scatter search. Electromagnetism meta-heuristic for project scheduling.

In the last few decades, several effective algorithms for solving the resource-constrained project scheduling problem have been proposed. However, the challenging nature of this problem, summarised in its strongly NP-hard status, restricts the effectiveness of exact optimisation to relatively small instances. In this paper, we present a new meta-heuristic for this problem, able to provide near-optimal heuristic solutions. The procedure combines elements from scatter search, a generic population-based evolutionary search method, and a recently introduced heuristic method for the optimisation of unconstrained continuous functions based on an analogy with electromagnetism theory, hereafter referred to as the electromagnetism meta-heuristic. We present computational experiments on standard benchmark datasets, compare the results with current state-ofthe-art heuristics, and show that the procedure is capable of producing consistently good results for challenging instances of the resource-constrained project scheduling problem. We also demonstrate that the algorithm outperforms state-of-the-art existing heuristics.Algorithms; Effectiveness; Electromagnetism; Functions; Heuristic; Project scheduling; Scatter; Scatter search; Scheduling; Theory;