scholarly journals Dynamic Constraint Models for Planning and Scheduling Problems

2000 ◽  
pp. 237-255 ◽  
Author(s):  
Roman Barták
Keyword(s):  
Scheduling Problems ◽  
Planning And Scheduling ◽  
Dynamic Constraint

How to model planning and scheduling problems using constraint networks on timelines

2010 ◽  
Vol 25 (3) ◽  
pp. 319-336 ◽  
Author(s):  
Gérard Verfaillie ◽  
Cédric Pralet ◽  
Michel Lemaître
Keyword(s):  
Dynamic Systems ◽  
Discrete Event ◽  
Discrete Event Dynamic Systems ◽  
Scheduling Problems ◽  
Planning And Scheduling ◽  
Constraint Networks ◽  
Modeling Power ◽  
Mission Management ◽  
Event Dynamic ◽  
Domain Management

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.

Steelmaking-Hot Rolling Scheduling Model and Method for Integrated Management in Iron and Steel Enterprises

2013 ◽  
Vol 860-863 ◽  
pp. 3094-3099 ◽  
Author(s):  
Bao Lin Zhu ◽  
Shou Feng Ji
Keyword(s):  
Production Scheduling ◽  
Integrated Management ◽  
Steel Production ◽  
Optimal Solution ◽  
Scheduling Problems ◽  
Planning And Scheduling ◽  
Iron And Steel ◽  
Scheduling Model ◽  
General Production ◽  
Iron And Steel Production

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.

scholarly journals Constraint satisfaction for planning and scheduling problems

Constraints ◽  
2011 ◽  
Vol 16 (3) ◽  
pp. 223-227 ◽  
Author(s):  
Roman Barták ◽  
Miguel A. Salido
Keyword(s):  
Constraint Satisfaction ◽  
Scheduling Problems ◽  
Planning And Scheduling

scholarly journals INCREMENTAL FILTERING ALGORITHMS FOR PRECEDENCE AND DEPENDENCY CONSTRAINTS

2008 ◽  
Vol 17 (01) ◽  
pp. 205-221 ◽  
Author(s):  
ROMAN BARTÁK ◽  
ONDŘEJ ČEPEK
Keyword(s):  
Crucial Role ◽  
Real Life ◽  
Precedence Constraints ◽  
Scheduling Problems ◽  
Planning And Scheduling ◽  
Filtering Algorithms ◽  
Life Problems

Precedence constraints specify that an activity must finish before another activity starts and hence such constraints play a crucial role in planning and scheduling problems. Many real-life problems also include dependency constraints expressing logical relations between the activities – for example, an activity requires presence of another activity in the plan. For such problems a typical objective is a maximization of the number of activities satisfying the precedence and dependency constraints. In the paper we propose new incremental filtering rules integrating propagation through both precedence and dependency constraints. We also propose a new filtering rule using the information about the requested number of activities in the plan. We demonstrate efficiency of the proposed rules on log-based reconciliation problems and min-cutset problems.

Sign in / Sign up

Export Citation Format

Share Document