Why is Scheduling Difficult? A CSP Perspective
Conference Paper, Proceedings of 9th European Conference on Artificial Intelligence (ECAI '90), pp. 754 - 767, August, 1990
Abstract
Interest in Constraint Satisfaction Problems (CSP) continues to grow, fueled by both their uniform problem representation, i.e., constraint graph, and conceptually clear problem solver, i.e., heuristically guided variable and value ordering. With the advent of interval constraints, e.g, temporal and spatial, and their associated consistency techniques, and the availability of Constraint Language Programming (CLP) it has become possible to explore complex problems such as planning and scheduling. This paper explores how a sequence of successively more complex scheduling problems can be modeled as a CSP, and the relevance of existing CSP problem solving heuristics.
BibTeX
@conference{Fox-1990-13142,author = {Mark S. Fox and Norman Sadeh-Koniecpol},
title = {Why is Scheduling Difficult? A CSP Perspective},
booktitle = {Proceedings of 9th European Conference on Artificial Intelligence (ECAI '90)},
year = {1990},
month = {August},
pages = {754 - 767},
}
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.