Solving planning and scheduling problems with combined integer and constraint programming

Author(s):  
Christian Timpe
2010 ◽  
Vol 25 (3) ◽  
pp. 319-336 ◽  
Author(s):  
Gérard Verfaillie ◽  
Cédric Pralet ◽  
Michel Lemaître

AbstractThe CNT framework (Constraint Network on Timelines) has been designed to model discrete event dynamic systems and the properties one knows, one wants to verify, or one wants to enforce on them. In this article, after a reminder about the CNT framework, we show its modeling power and its ability to support various modeling styles, coming from the planning, scheduling, and constraint programming communities. We do that by producing and comparing various models of two mission management problems in the aerospace domain: management of a team of unmanned air vehicles and of an Earth observing satellite.


2000 ◽  
Vol 6 (6) ◽  
pp. 511-520 ◽  
Author(s):  
Ouajdi Korbaa ◽  
Pascal Yim ◽  
Jean-Claude Gentina

2013 ◽  
Vol 860-863 ◽  
pp. 3094-3099 ◽  
Author(s):  
Bao Lin Zhu ◽  
Shou Feng Ji

Iron and steel production scheduling problems are different from general production scheduling in machine industry. They have to meet special demands of steel production process. The CCR production manner dramatically promotes the revolution in technology and management, especially to planning and scheduling. In this paper, a scheduling model is presented to integrate the three working procedures and the lagrangian relaxation technology is proposed to get the optimal solution of the scheduling model. Finally, numerical examples are given to demonstrate the effectiveness of the integrated model and method.


Sign in / Sign up

Export Citation Format

Share Document