A NEW ALGORITHM FOR MULTI-SKILL RESOURCE CONSTRAINED PROJECT SCHEDULING PROBLEM BASED ON CUCKOO SEARCH STRATEGY

2020 ◽  
Vol 65 (6) ◽  
pp. 98-109
Author(s):  
Huu Dang Quoc ◽  
Loc Nguyen The ◽  
Cuong Nguyen Doan ◽  
Toan Phan Thanh
Keyword(s):  
Project Scheduling ◽  
Search Strategy ◽  
Scheduling Algorithm ◽  
Optimal Schedule ◽  
Cuckoo Search ◽  
Scheduling Problem ◽  
Resource Constrained ◽  
Start Time ◽  
Resource Constrained Project Scheduling ◽  
Project Scheduling Problem

The purpose of this paper is to consider the project scheduling problem under such limited constraint, called Multi-Skill Resource-Constrained Project Scheduling Problem or MS-RCPSP. The algorithm proposed in this paper is to find the optimal schedule, determine the start time for each task so that the execution time (also called makespan) taken is minimal. At the same time, our scheduling algorithm ensures that the given priority relationships and constraints are not violated. Our scheduling algorithm is built based on the Cuckoo Search strategy. In order to evaluate the proposed algorithm, experiments were conducted by using the iMOPSE dataset. The experimental results proved that the proposed algorithm found better solutions than the previous algorithm.

scholarly journals A nettó jelenérték maximalizálása erőforrás-korlátos projektekben - egy új harmóniakereső metaheurisztika (A harmony search metaheuristic for the resourceconstrained project scheduling problem with discounted cash flows)

2009 ◽  
pp. 55-61
Author(s):  
Blanka Láng
Keyword(s):  
Project Scheduling ◽  
Harmony Search ◽  
Optimal Schedule ◽  
Cash Flows ◽  
Mixed Integer ◽  
Small Scale ◽  
Scheduling Problem ◽  
Resource Constrained ◽  
Resource Constrained Project Scheduling ◽  
Project Scheduling Problem

Ebben a tanulmányban a szerző egy új harmóniakereső metaheurisztikát mutat be, amely a minimális időtartamú erőforrás-korlátos ütemezések halmazán a projekt nettó jelenértékét maximalizálja. Az optimális ütemezés elméletileg két egész értékű (nulla-egy típusú) programozási feladat megoldását jelenti, ahol az első lépésben meghatározzuk a minimális időtartamú erőforrás-korlátos ütemezések időtartamát, majd a második lépésben az optimális időtartamot feltételként kezelve megoldjuk a nettó jelenérték maximalizálási problémát minimális időtartamú erőforrás-korlátos ütemezések halmazán. A probléma NP-hard jellege miatt az egzakt megoldás elfogadható idő alatt csak kisméretű projektek esetében képzelhető el. A bemutatandó metaheurisztika a Csébfalvi (2007) által a minimális időtartamú erőforrás-korlátos ütemezések időtartamának meghatározására és a tevékenységek ennek megfelelő ütemezésére kifejlesztett harmóniakereső metaheurisztika továbbfejlesztése, amely az erőforrás-felhasználási konfliktusokat elsőbbségi kapcsolatok beépítésével oldja fel. Az ajánlott metaheurisztika hatékonyságának és életképességének szemléltetésére számítási eredményeket adunk a jól ismert és népszerű PSPLIB tesztkönyvtár J30 részhalmazán futtatva. Az egzakt megoldás generálásához egy korszerű MILP-szoftvert (CPLEX) alkalmaztunk. _______________ This paper presents a harmony search metaheuristic for the resource-constrained project scheduling problem with discounted cash flows. In the proposed approach, a resource-constrained project is characterized by its „best” schedule, where best means a makespan minimal resource constrained schedule for which the net present value (NPV) measure is maximal. Theoretically the optimal schedule searching process is formulated as a twophase mixed integer linear programming (MILP) problem, which can be solved for small-scale projects in reasonable time. The applied metaheuristic is based on the "conflict repairing" version of the "Sounds of Silence" harmony search metaheuristic developed by Csébfalvi (2007) for the resource-constrained project scheduling problem (RCPSP). In order to illustrate the essence and viability of the proposed harmony search metaheuristic, we present computational results for a J30 subset from the well-known and popular PSPLIB. To generate the exact solutions a state-of-the-art MILP solver (CPLEX) was used.

scholarly journals Improved discrete cuckoo search for the resource-constrained project scheduling problem

2018 ◽  
Vol 69 ◽  
pp. 493-503 ◽  
Author(s):  
Kirils Bibiks ◽  
Yim-Fun Hu ◽  
Jian-Ping Li ◽  
Prashant Pillai ◽  
Aleister Smith
Keyword(s):  
Project Scheduling ◽  
Cuckoo Search ◽  
Scheduling Problem ◽  
Resource Constrained ◽  
Resource Constrained Project Scheduling ◽  
Project Scheduling Problem

A Resource Flow Based Branch-and-bound Algorithm to Solve Fuzzy Stochastic Resource-constrained Project Scheduling Problem

2021 ◽  
Author(s):  
Yaghoub Alipouri
Keyword(s):  
Branch And Bound ◽  
Project Scheduling ◽  
Resource Constraints ◽  
Scheduling Problem ◽  
Optimal Solutions ◽  
Resource Constrained ◽  
Start Time ◽  
Resource Flow ◽  
Resource Constrained Project Scheduling ◽  
Project Scheduling Problem

Abstract In this paper a resource flow based branch-and-bound procedure is designed to solve the well-known resource constrained project scheduling problem under the mixed uncertainty of fuzziness and randomness (FS-RCPSP). The objective is to minimize the expected makespan of the project subject to precedence and resource constraints. The proposed branch-and-bound can be employed to obtain optimal solutions and also can be truncated in order to find promising near optimal solutions. The depth-first strategy is utilized for constructing the search tree and earliest start time (EST) concept is adopted for selecting a node for further branching while traversing the tree down to the leaves. The performance of developed branch-and-bound is benchmarked against CPLEX and SADESP across an extensive set of 960 problems. The results returned by the proposed algorithm show experimentally its effectiveness to solve the FS-RCPSP.

Sign in / Sign up

Export Citation Format

Share Document