Scheduling resource-constrained projects with a flexible project structure

Kellenbrink, Carolin; Helber, Stefan

doi:10.1016/j.ejor.2015.05.003

Cited by 58 publications

(40 citation statements)

References 36 publications

(22 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Most, if not all, past research has classified these activities under categories B or C. Therefore, and worth highlighting, researchers have offered different algorithms as a way to find the best solution for each of the three types of classification, each taken individually. However, the problem is: researchers have classified the project activities individually under categories A, B, or C (e.g., Peteghem and Vanhoucke 2010; Kellenbrink and Helber 2015). However, in practice, in most engineering projects, if not all, some of these activities can be classified under category D rather than category B or C to give the manager more flexibility in scheduling and planning projects.…”

Section: Fig 6 An Activity Classified Under Category Dmentioning

confidence: 99%

A survey in the resource-constrained project and multi-project scheduling problems

Issa¹,

Tu²

2020

10.5267/j.jpm

View full text Add to dashboard Cite

Resource-Constrained Project and Multi-Project Scheduling Problems (RCPSPs and RCMPSPs) have been essential topics of study over the last three decades. Both problems consist of activities that must be scheduled subject to precedence and resource constraints. This paper surveys studies of RCPSPs and RCMPSPs under consideration of four categories of project activities, simply recorded as categories A, B, C, and D. Category A refers to activities can be performed using fixed resources along The Y-axis over fixed durations along The X-axis, and cannot be interrupted. Category B applies to activities that can be performed using the same type of resource in category A but can be interrupted. Category C refers to activities that can be performed using flexible resources over flexible durations and cannot be interrupted. Category D refers to activities can be performed using flexible resources over flexible durations and can be interrupted. Many algorithms have been developed to solve the RCPSPs and RCMPSPs when activities are classified individually under category A, B, or C. However, in practice, welding, cutting or assembly activities in a manufacturing projects for an oil cargo can be under a new category so-called D. The project manager can speed up or slow down these activities by allocating or removing more resources, and these activities can be interrupted or can be resumed at any time. From the perspective of activity categories, we intend to review the literature on RCPSPs and RCMP-SPs and to obtain the new research directions for solving the problems.

show abstract

Section: Fig 6 An Activity Classified Under Category Dmentioning

confidence: 99%

A survey in the resource-constrained project and multi-project scheduling problems

Issa¹,

Tu²

2020

10.5267/j.jpm

View full text Add to dashboard Cite

show abstract

“…RCPSP-MR problems can be regarded in the scheduling of projects, such as mechanizing various production line, launching SCADA systems, launching smart urban systems, dispatching liquid reservoirs fuel, launching different vehicle tracking systems, developing educational simulators, developing electronic Siebel for shooting training and reverse engineering of critical and important equipment. Also, RCPSP-MR is defined and described in this paper is indicated in flexible manufacturing cells (FMCs) according to the related literature [e.g., [42][43][44][45][46][47][48][49][50][51][52][53][54][55].…”

Section: Introductionmentioning

confidence: 99%

Designing a resource-constrained project scheduling model considering multiple routes for flexible project activities: meta-heuristic algorithms

2019

View full text Add to dashboard Cite

Resource constrained project scheduling problem with multiple routes for flexible project activities (RCPSP-MR) is a generalization of the RCPSP, in which for the implementation of each flexible activity in main structure of the project, several exclusive sub-networks are considered. Each sub-network is regarded as a route for the flexible activity. The routes are considered for each flexible activity that are varied in terms of: 1) Number of activities required to execute; 2) Precedence relationship between activates; 3) Allocation of different renewable and nonrenewable resources to each activity; and 4) Effectiveness on the duration and cost of project completion. In this paper, a new mathematical formulation of RCPSP-MR is firstly presented. Then, two solving approaches based on particle swarm optimization (PSO) and genetic algorithm (GA) are proposed to minimize costs of project completion. To evaluate the effectiveness of these proposed approaches, 50 problems (in very small, small, medium, and large-sized test problems) are designed and then are solved. Finally, comparisons are provided. Computational results show that the proposed GA generates high-quality solutions in a timely fashion. Keywords: Resource constrained project scheduling problem (RCPSP), flexible activities, multiple routes, particle swarm optimization (PSO), genetic algorithm (GA) 0,1, 2,..., 1 JN  1 J Set of total project fixed activities, 1 JJ  2 J Set of total flexible project activities, 21 J J J    Set of routes of each flexible activity 2 J   h  Set of total sub network for flexible activity

show abstract

“…Aircraft engine remanufacturing is executed by independent service contractors or original equipment manufacturers. In either case, this complex process typically has a project character, see Kellenbrink and Helber (2015) and Kellenbrink and Helber (2016), as the state of the engines as well as the chosen repair or replace options differ from case to case. The customers are typically airlines that are interested in short remanufacturing processes.…”

Section: Projects With Flexible Capacity Constraints Makespan-dependmentioning

confidence: 99%

Profit-oriented scheduling of resource-constrained projects with flexible capacity constraints

Schnabel

Kellenbrink

Helber

2018

Bus Res

Self Cite

View full text Add to dashboard Cite

We consider a novel generalization of the resource-constrained project scheduling problem (RCPSP). Unlike many established approaches for the RCPSP that aim to minimize the makespan of the project for given static capacity constraints, we consider the important real-life aspect that capacity constraints can often be systematically modified by temporarily assigning costly additional production resources or using overtime. We, furthermore, assume that the revenue of the project decreases as its makespan increases and try to find a schedule with a profitmaximizing makespan. Like the RCPSP, the problem is NP-hard, but unlike the RCPSP, it turns out that an optimal schedule does not have to be among the set of so-called active schedules. Scheduling such a project is a formidable task, both from a practical and a theoretical perspective. We develop, describe, and evaluate alternative solution encodings and schedule decoding mechanisms to solve this problem within a genetic algorithm framework and we compare the solutions obtained to both optimal reference values and the results of a commercial local search solver called LocalSolver.

show abstract

Scheduling resource-constrained projects with a flexible project structure

Cited by 58 publications

References 36 publications

A survey in the resource-constrained project and multi-project scheduling problems

A survey in the resource-constrained project and multi-project scheduling problems

Designing a resource-constrained project scheduling model considering multiple routes for flexible project activities: meta-heuristic algorithms

Profit-oriented scheduling of resource-constrained projects with flexible capacity constraints

Contact Info

Product

Resources

About