ANOR
2002
13 years 4 months ago
2002
Abstract. The generic hoist scheduling problem is NP-hard and arises from automated manufacturing lines. In recent work using the constraint logic programming (CLP) formalism, a un...
ICCS
2001
Springer
13 years 9 months ago
2001
Springer
The Sisyphus-I initiative consists of a constraint satisfaction problem in which a group of people in a research environment must be allocated rooms. Numerous constraints are detai...
ICS
2010
Tsinghua U.
13 years 9 months ago
2010
Tsinghua U.
When something unexpected happens in a large production system, administrators must first perform a search to isolate which components and component interactions are likely to be...