The resource-constrained project scheduling problem (RCPSP) consists of a set of non-preemptive activities that follow precedence relationship and consume resources. Under the limited amount of the resources, the obje...
详细信息
The resource-constrained project scheduling problem (RCPSP) consists of a set of non-preemptive activities that follow precedence relationship and consume resources. Under the limited amount of the resources, the objective of RCPSP is to find a schedule of the activities to minimize the project makespan. This article presents a new genetic algorithm (GA) by incorporating a local search strategy in GA operators. The local search strategy improves the efficiency of searching the solution space while keeping the randomness of the GA approach. Extensive numerical experiments show that the proposed GA with neighborhood search works well regarding solution quality and computational time compared with existing algorithms in the RCPSP literature, especially for the instances with a large number of activities. (C) 2011 Wiley Periodicals, Inc. Naval Research Logistics 58: 73-82, 2011
This paper presents the Local Search with Subproblem Exact Resolution (LSSPER) method based on large neighbourhood search for solving the resource-constrained project scheduling problem (RCPSP). At each step of the me...
详细信息
This paper presents the Local Search with Subproblem Exact Resolution (LSSPER) method based on large neighbourhood search for solving the resource-constrained project scheduling problem (RCPSP). At each step of the method, a subpart of the current solution is fixed while the other part defines a subproblem solved externally by a heuristic or an exact solution approach (using either constraint programming techniques or mathematical programming techniques). Hence, the method can be seen as a hybrid scheme. The key point of the method deals with the choice of the subproblem to be optimized. In this paper, we investigate the application of the method to the RCPSP. Several strategies for generating the subproblem are proposed. In order to evaluate these strategies, and, also, to compare the whole method with current state-of-the-art heuristics, extensive numerical experiments have been performed. The proposed method appears to be very efficient.
The resource-constrained project scheduling problem (RCPSP) is an NP-hard optimization problem. RCPSP is one of the most important and challenging problems in the project management field. In the past few years, many ...
详细信息
The resource-constrained project scheduling problem (RCPSP) is an NP-hard optimization problem. RCPSP is one of the most important and challenging problems in the project management field. In the past few years, many researches have been proposed for solving the RCPSP. The objective of this problem is to schedule the activities under limited resources so that the project makespan is minimized. This paper proposes a new algorithm for solving RCPSP that combines the concepts of negative selection mechanism of the biologic immune system, simulated annealing algorithm (SA), tabu search algorithm (TS) and genetic algorithm (GA) together. The performance of the proposed algorithm is evaluated and compared to current state-of-the-art metaheuristic algorithms. In this study, the benchmark data sets used in testing the performance of the proposed algorithm are obtained from the projectschedulingproblem library. The performance is measured in terms of the average percentage deviation from the critical path lower bound. The experimental results show that the proposed algorithm outperforms the state-of-the-art metaheuristic algorithms on all standard benchmark data sets.
This paper describes how the resource-constrained project scheduling problem (RCPSP) can be used as a basis for comprehensive disruption management, concerned with both rescheduling as well as potential structural pro...
详细信息
ISBN:
(纸本)9781424401956
This paper describes how the resource-constrained project scheduling problem (RCPSP) can be used as a basis for comprehensive disruption management, concerned with both rescheduling as well as potential structural process modifications. It is illustrated, how the RCPSP can be extended by the possibility to represent alternative activities and how the respective constructs can be used to describe various forms of typical interventions. Moreover, an approach for schedule optimization and the resolution of the generalized problem is presented, based on the combination of well-established methodologies and specific evolutionary operators. In an illustrative example it is finally shown how the proposed framework can be applied for the development of real-time decision support systems in the domain of airport ground process management.
schedulingprojects under limited resource availability, which is called the resource-constrained project scheduling problem (RCPSP), has a wide range of real-world applications, e.g., in mining, manufacturing and sup...
详细信息
projectscheduling in the resource-constrained situation is one of the key issues of project-oriented organizations. The aim of resource-constrained project scheduling problem (RCPSP) is to find a schedule with minimu...
详细信息
projectscheduling in the resource-constrained situation is one of the key issues of project-oriented organizations. The aim of resource-constrained project scheduling problem (RCPSP) is to find a schedule with minimum makespan by considering precedence and resource constraints. RCPSP is a combinatorial optimization problem and belongs to the NP-hard class of problems. The exact methods search the entire search space and are unable to solve a large-sized project network problem. Thus, metaheuristics are used to solve this problem in a short computational time. Due to the probabilistic nature of metaheuristics, it is a challenging problem to make a balance between exploitation and exploration phases. The literature review shows that embedding of chaos improves both the convergence speed and the local optima avoidance of metaheuristics. This paper presents a Chaotic Vibrating Particles System (CVPS) optimization algorithm for solving the RCPSP. Vibrating Particles System (VPS) is a physics-inspired metaheuristic which mimics the free vibration of single-degree-of-freedom systems with viscous damping. The performance and applicability of the CVPS are compared with the standard VPS and five well-known algorithms on three benchmark instances of the RCPSPs. Experimental studies reveal that the proposed optimization method is a promising alternative to assist project managers in dealing with RCPSP. (C) 2020 Sharif University of Technology. All rights reserved.
The classical resource-constrained project scheduling problem (RCPSP), a well-known NP-hard problem in scheduling, is one of the most extensively investigated problems in operations research. It has been attracting co...
详细信息
ISBN:
(纸本)9781467362030
The classical resource-constrained project scheduling problem (RCPSP), a well-known NP-hard problem in scheduling, is one of the most extensively investigated problems in operations research. It has been attracting considerable attention from academia and industry for several decades. Recently, a number of new and promising meta-heuristic approaches for solving the RCPSP problem have emerged. In this paper, we provide a detailed review of the most recent approaches for solving the RCPSP that have been proposed in literature. In particular, we present a comparison, classification and analysis, based on a number of relevant metrics. Extensive numerical results based on well-known benchmark problem instance sets of size J30, J60 and J120 from projectschedulingproblem Library (PSPLIB), as well as comparisons among state-of-the-art hybrid meta-heuristic algorithms demonstrate the effectiveness of the proposed approaches for solving the RCPSP of various scales.
Automatic generation of construction schedules has emerged as a key solution to address the inefficiencies and instabilities arising from the over-reliance on empirical judgment. However, traditional construction sche...
详细信息
Automatic generation of construction schedules has emerged as a key solution to address the inefficiencies and instabilities arising from the over-reliance on empirical judgment. However, traditional construction scheduling has been predominantly limited to regional levels, inadequately addressing the lean construction requirements of component-based prefabricated steel frame (PSF) structures. To bridge this gap, this study formulates an optimization model for the component-level resource-constrained project scheduling problem for PSF structures (C-RCPSP-PSF), which realizes the automatic extraction of precedence relationships from building information modeling three-dimensional (BIM 3D) models and the minimization of construction duration, costs, and carbon emissions. To address the C-RCPSP-PSF model, a novel multiobjective ant colony system (MOACS) algorithm is developed that utilizes three distinct colonies to individually tackle the objectives and combines taboo lists and global archives to enhance the search. Experimental results show the superior convergence and diversity of the MOACS over that of other competitive multiobjective optimization algorithms in solving the proposed model.
A destructive lower bound for the multi-mode resource-con strained projectschedulingproblem with minimal and maximal time-lags is presented. Given are n activities which may be processed in different modes without p...
详细信息
A destructive lower bound for the multi-mode resource-con strained projectschedulingproblem with minimal and maximal time-lags is presented. Given are n activities which may be processed in different modes without preemptions. During processing certain amounts of renewable and non-renewable resources are needed where the available capacity of each resource type is limited. Furthermore, minimal and maximal time-lags between the activities are given. The objective is to determine a schedule with minimal makespan. The lower bound calculations are based on two methods for proving infeasibility of a given threshold value T for the makespan. The first uses constraint propagation techniques, while the second is based on a linear programming formulation which is solved by a column generation procedure. Computational results are reported for several test instances of the multi-mode problem with and without time-lags and the single-mode version with time-lags. (C) 2002 Elsevier Science B.V. All rights reserved.
In this paper, a new moving block sequence (MBS) representation for resource-constrained project scheduling problems (RCPSPs) is proposed, which is different from the classical activity list that has been widely used ...
详细信息
ISBN:
(纸本)9781509006229
In this paper, a new moving block sequence (MBS) representation for resource-constrained project scheduling problems (RCPSPs) is proposed, which is different from the classical activity list that has been widely used for RCPSPs. An activity in a project of RCPSPs has fixed duration and resource demands, thus, it can be modeled as a rectangle block whose height represents the resource demands and width the duration. Therefore, by modeling every activity in a project as a block, a project that consists of N activities can be represented as a permutation of N blocks that satisfy the precedence constraints. Then, for every activity in the project, four initial positions and corresponding move modes are designed, by using which activities can be moved from their initial positions to the appropriate locations that minimize the makespan of the project without violating the precedence and resource constraints. Based on this newly designed MBS representation, the multi-agent evolutionary algorithm (MAEA) is used for solving RCPSPs. The comparison with 16 existing state-of-the-art algorithms on benchmark J30 test set, which contains 480 instances in total, shows that the proposed algorithm is competitive in solving RCPSPs.
暂无评论