Scheduling alternative activities
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
An Open-Ended Finite Domain Constraint Solver
PLILP '97 Proceedings of the9th International Symposium on Programming Languages: Implementations, Logics, and Programs: Including a Special Trach on Declarative Programming Languages in Education
Visopt ShopFloor: On the Edge of Planning and Scheduling
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Dynamic Constraint Models for Planning and Scheduling Problems
Selected papers from the Joint ERCIM/Compulog Net Workshop on New Trends in Contraints
SLIDE: A Useful Special Case of the CARDPATH Constraint
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Visopt shopfloor: going beyond traditional scheduling
ERCIM'02/CologNet'02 Proceedings of the 2002 Joint ERCIM/CologNet international conference on Constraint solving and constraint logic programming
| Hi-index | 0.00 |
Constraint-based scheduling is an approach for solving scheduling problems using constraint satisfaction techniques. Its main advantage over the traditional scheduling techniques is possibility to model real-life restrictions via specialised constraints. 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.