Feasible distributed CSP models for scheduling problems

Nowadays, many real problems can be formalized as Distributed CSPs. A distributed constraint satisfaction problem (DisCSP) is a CSP in which variables and constraints are distributed among multiple automated agents. Many researchers assume for simplicity that each agent has exactly one variable. For real planning and scheduling problems, these distributed techniques require a large amount of messages passed among agents, so these problems are very difficult to solve. In this paper, we present a general distributed model for solving real-life scheduling problems and propose some guidelines for distributing large-scale problems. Furthermore, we present two case studies in which two scheduling problems are distributed by using our model.

• Type: Journal
• Year: 2008
• Where: EAAI
• Authors: Miguel A. Salido, Adriana Giret
• Keywords: Distributed Constraint Satisfaction, EAAI 2008, Problems, Scheduling Problems