论文信息 - Modelling Transition Constraints

Modelling Transition Constraints

Scheduling problems belong to a very successful application area of constraint programming partially thanks to many specialised global constraints defined for scheduling problems. In the paper we propose a concept of the transition constraint that is used to model a state change in resources. We describe and compare three models of the transition constraint. These models have been implemented and tested in the scheduling engine of Visopt ShopFloor system.

Roman Barták

[1] Roman Barták. Visopt ShopFloor: On the Edge of Planning and Scheduling , 2002, CP.

[2] Roman Barták,et al. A General Relation Constraint: An Implementation , 2000 .

[3] Roman Barták. Filtering Algorithms for Tabular Constraints , 2001 .

[4] Roman Barták. Dynamic Constraint Models for Planning and Scheduling Problems , 1999, New Trends in Constraints.

[5] Roman Barták. Conceptual Models for Combined Planning and Scheduling , 2000, Electron. Notes Discret. Math..

[6] Mats Carlsson,et al. An Open-Ended Finite Domain Constraint Solver , 1997, PLILP.

[7] J. Christopher Beck,et al. Scheduling Alternative Activities , 1999, AAAI/IAAI.