Abstract
This paper addresses the Multi-Skill Resource-Constrained Project Scheduling Problem with Transfer Times (MSRCPSP-TT). A new model has been developed that incorporates the presence of transfer times within the multi-skill RCPSP. The proposed model aims to minimize project’s duration and cost, concurrently. The MSRCPSP-TT is an NP-hard problem; therefore, a Multi-Objective Multi-Agent Optimization Algorithm (MOMAOA) is proposed to acquire feasible schedules. In the proposed algorithm, each agent represents a feasible solution that works with other agents in a grouped environment. The agents evolve due to their social, autonomous, and self-learning behaviors. Moreover, the adjustment of environment helps the evolution of agents as well. Since the MSRCPSP-TT is a multi-objective optimization problem, the Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS) is used in different procedures of the MOMAOA. Another novelty of this paper is the application of TOPSIS in different procedures of the MOMAOA. These procedures are utilized for: (1) detecting the leader agent in each group, (2) detecting the global best leader agent, and (3) the global social behavior of the MOMAOA. The performance of the MOMAOA has been analyzed by solving several benchmark problems. The results of the MOMAOA have been validated through comparisons with three other meta-heuristics. The parameters of algorithms are determined by the Response Surface Methodology (RSM). The Kruskal–Wallis test is implemented to statistically analyze the efficiency of methods. Computational results reveal that the MOMAOA can beat the other three methods according to several testing metrics. Furthermore, the impact of transfer times on project’s duration and cost has been assessed. The investigations indicate that resource transfer times have significant impact on both objectives of the proposed model.
Highlights
In the Resource-Constrained Project Scheduling Problem (RCPSP), a group of activities which are bound together based on precedence relations are scheduled so that the project’s duration is minimized
A bi-objective mathematical formulation has been developed for the multi-skill RCPSP considering resource transfer times (MSRCPSP-TT)
Since the problem was classified as an NP-hard problem, a multi-objective multi-agent optimization algorithm (MOMAOA) was developed to approximate the Pareto-optimal front
Summary
In the Resource-Constrained Project Scheduling Problem (RCPSP), a group of activities which are bound together based on precedence relations are scheduled so that the project’s duration is minimized. Multi-Skill Resource-Constrained Project Scheduling Problem (MSRCPSP) is a variant of the standard RCPSP which has been studied widely in the literature [26]. The main goal of this paper is to propose a bi-objective model for the multiskill RCPSP with resource transfer times (MSRCPSP-TT). Multi-agent based methods have been widely used for optimization problems and showed good performance As another contribution of this paper, we design a Multi-Objective Multi-Agent Optimization Algorithm (MOMAOA) to solve the MSRCPSP-TT. The main contributions of this research are threefold: First, a bi-objective model is mathematically formulated for the MSRCPSP, where multi-skill workers must travel between different sites to perform their assigned tasks. The budget considered for completion of a project is limited To solve this model, a multi-objective multi-agent optimization method has been proposed.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
