scholarly journals A Constraint Programming Method for Advanced Planning and Scheduling System with Multilevel Structured Products

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Yunfang Peng ◽  
Dandan Lu ◽  
Yarong Chen
Keyword(s):  
Constraint Programming ◽  
Programming Model ◽  
Computational Study ◽  
Constraint Propagation ◽  
Mixed Integer ◽  
Release Time ◽  
Planning And Scheduling ◽  
Structured Products ◽  
Advanced Planning And Scheduling ◽  
Advanced Planning

This paper deals with the advanced planning and scheduling (APS) problem with multilevel structured products. A constraint programming model is constructed for the problem with the consideration of precedence constraints, capacity constraints, release time and due date. A new constraint programming (CP) method is proposed to minimize the total cost. This method is based on iterative solving via branch and bound. And, at each node, the constraint propagation technique is adapted for domain filtering and consistency check. Three branching strategies are compared to improve the search speed. The results of computational study show that the proposed CP method performs better than the traditional mixed integer programming (MIP) method. And the binary constraint heuristic branching strategy is more effective than the other two branching strategies.

scholarly journals Advanced Planning and Scheduling Systems based on Time Windows and Constraint Programming

2013 ◽  
Vol 46 (7) ◽  
pp. 192-197 ◽  
Author(s):  
Marcosiris A.O. Pessoa ◽  
Richard A. Estombelo Montesco ◽  
Fabricio Junqueira ◽  
Diolino Jose dos Santos Filho ◽  
Paulo E. Miyagi
Keyword(s):  
Constraint Programming ◽  
Time Windows ◽  
Planning And Scheduling ◽  
Advanced Planning And Scheduling ◽  
Advanced Planning

scholarly journals Solving the nuclear dismantling project scheduling problem by combining mixed-integer and constraint programming techniques and metaheuristics

2021 ◽  
Author(s):  
Felix Hübner ◽  
Patrick Gerhards ◽  
Christian Stürck ◽  
Rebekka Volk
Keyword(s):  
Constraint Programming ◽  
Project Scheduling ◽  
Computational Study ◽  
Real Life ◽  
Mixed Integer ◽  
Extensive Literature ◽  
Scheduling Problem ◽  
Multiple Modes ◽  
Project Scheduling Problem ◽  
Optimisation Techniques

AbstractScheduling of megaprojects is very challenging because of typical characteristics, such as expected long project durations, many activities with multiple modes, scarce resources, and investment decisions. Furthermore, each megaproject has additional specific characteristics to be considered. Since the number of nuclear dismantling projects is expected to increase considerably worldwide in the coming decades, we use this type of megaproject as an application case in this paper. Therefore, we consider the specific characteristics of constrained renewable and non-renewable resources, multiple modes, precedence relations with and without no-wait condition, and a cost minimisation objective. To reliably plan at minimum costs considering all relevant characteristics, scheduling methods can be applied. But the extensive literature review conducted did not reveal a scheduling method considering the special characteristics of nuclear dismantling projects. Consequently, we introduce a novel scheduling problem referred to as the nuclear dismantling project scheduling problem. Furthermore, we developed and implemented an effective metaheuristic to obtain feasible schedules for projects with about 300 activities. We tested our approach with real-life data of three different nuclear dismantling projects in Germany. On average, it took less than a second to find an initial feasible solution for our samples. This solution could be further improved using metaheuristic procedures and exact optimisation techniques such as mixed-integer programming and constraint programming. The computational study shows that utilising exact optimisation techniques is beneficial compared to standard metaheuristics. The main result is the development of an initial solution finding procedure and an adaptive large neighbourhood search with iterative destroy and recreate operations that is competitive with state-of-the-art methods of related problems. The described problem and findings can be transferred to other megaprojects.

Sign in / Sign up

Export Citation Format

Share Document