Solving the resource-constrained multi-project scheduling problem with an improved critical chain method

2019 ◽  
Vol 71 (8) ◽  
pp. 1243-1258 ◽  
Author(s):  
Min Tian ◽  
Ren Jing Liu ◽  
Guang Jun Zhang
Keyword(s):  
Project Scheduling ◽  
Scheduling Problem ◽  
Resource Constrained ◽  
Project Scheduling Problem ◽  
Critical Chain

A Revised Critical Chain Method and Optimization Model

2009 ◽  
Vol 16-19 ◽  
pp. 426-430 ◽  
Author(s):  
Wu Liang Peng ◽  
Min Li Jin
Keyword(s):  
Product Development ◽  
Project Scheduling ◽  
Optimization Model ◽  
Development Projects ◽  
Scheduling Problem ◽  
Optimal Model ◽  
Resource Constrained ◽  
Schedule Scheme ◽  
Project Scheduling Problem ◽  
Critical Chain

For product development projects, to void the risk of project delay, all the tasks should be finished as soon as possible. However, the critical chain method (CCM) requires the non-critical tasks to be executed as late as possible. In this paper, the traditional CCM is revised based on the characteristics of product development. Other than the traditional one, the revised CCM is created based on the active plan, that is, all tasks should be executed as early as possible. And then, the schedule scheme of active plan based critical chain method is given, including searching critical chain, no-critical chain and setting buffers. Consulting in the resource constrained project scheduling problem (RCPSP), an optimal model of CCM is built.

Modeling and algorithm for resource-constrained multi-project scheduling problem based on detection and rework

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Hongwei Zhu ◽  
Zhiqiang Lu ◽  
Chenyao Lu ◽  
Yifei Ren
Keyword(s):  
Tabu Search ◽  
Project Scheduling ◽  
Scheduling Problem ◽  
Assembly Process ◽  
Resource Constrained ◽  
Content Type ◽  
Baseline Schedule ◽  
Execution Sequence ◽  
Project Scheduling Problem ◽  
Critical Chain

Purpose To meet the requirement of establishing an effective schedule for the assembly process with overall detection and rework, this paper aims to address a new problem named resource-constrained multi-project scheduling problem based on detection and rework (RCMPSP-DR). Design/methodology/approach First, to satisfy both online and offline scheduling, a mixed integer programming model is established with a weighted bi-objective minimizing the expected makespan and the solution robustness. Second, an algorithm that combines a tabu search framework with a critical chain-based baseline generation scheme is designed. The tabu search framework focuses on searching for a reasonable resource flow representing the execution sequence of activities, while the critical chain-based baseline generation scheme establishes a buffered baseline schedule by estimating the tradeoff between two aspects of bi-objective. Findings The proposed algorithm can get solutions with gaps from −4.45% to 2.33% when compared with those obtained by the commercial MIP solver CPLEX. Moreover, the algorithm outperforms four other algorithms in terms of both objective performance and stability over instances with different weighting parameters, which reveals its effectiveness. Originality/value The represented RCMPSP-DR considering the overall detection and rework is an extension of the scheduling problem for large-scale equipment. An effective algorithm is proposed to establish the baseline schedule and determine the execution sequence of activities for the assembly process, which is significant for practical engineering applications.

Sign in / Sign up

Export Citation Format

Share Document