This paper presents an example of cooperation between AI planning techniques and Constraint Programming or Operations Research. More precisely, it presents a way of boosting forward planning using combinatorial optimization techniques. The idea consists in combining on one hand a dynamic model that represents the Markovian dynamics of the system considered ( i.e. state transitions), and on the ...

perishability of blood products as well as uncertainty in demand amounts complicate the management of blood supply for blood centers. this paper addresses a mixed-integer linear programming model for blood platelets production planning while integrating the processes of blood collection as well as production/testing, inventory control and distribution. whole blood-derived production methods for...

Integer programming has become popular to synthesis since it allows to compute optimal solutions by efficient formal methods. The drawback of this approach to synthesis is its resticted mathematical model. We adopted the basic idea of handling the synthesis problem as a constraint satisfaction problem and focus on solving it by constraint search. We use constraint logic programming, which is mo...

1.1 Abstract We view constraints as relations and constraint satisfaction as a dynamic process of approaching the solution set of the constraints. We have developed a semantic model for dynamic systems, called Constraint Nets, to provide a real-time programming semantics and to model and analyze dynamic systems. In this paper, we explore the relationship between constraint satisfaction and cons...

We view constraints as relations and constraint satisfaction as a dynamic process of approaching a stable equilibrium. We have developed an algebraic model of dynamics, called Constraint Nets, to provide a real-time programming semantics and to model and analyze dynamic systems. In this paper, we explore the relationship between constraint satisfaction and constraint nets by showing how to impl...

Constraint Programming (CP) is a powerful paradigm for solving Combinatorial Problems (generally issued from Decision Making). In CP, Enumeration Strategies are crucial for resolution performances. In this work, we model the known benchmark problems Latin Square, Magic Square and Sudoku as a Constraint Satisfaction Problems. We solve them with Constraint Programming comparing the performance of...

Yard crane is an important resource in container terminals. Efficient utilization of the yard crane significantly improves the productivity and the profitability of the container terminal. This paper presents a mixed integer programming model for the yard crane scheduling problem with non- interference constraint that is NPHARD in nature. In other words, one of the most important constraints in...