Advertisement

Scheduling Agents – Distributed Timetabling Problems

  • Amnon Meisels
  • Eliezer Kaplansky
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2740)

Abstract

Many real-world Timetabling Problems are composed of organizational parts that need to timetable their staff in an independent way, while adhering to some global constraints. Later, the departmental timetables are combined to yield a coherent, consistent solution. This last phase involves negotiations with the various agents and requests for changes in their own solutions.

Most of the real-world distributed timetabling problems that fall into this class have global constraints that involve many of the agents in the system. Models that use networks of binary constraints are inadequate. As a result, this paper proposes a new model that contains only one additional agent: the Central Agent that coordinates the search process of all Scheduling Agents (SAs). Preliminary experiments show that a sophisticated heuristic is needed for the CA to effectively interact with its scheduling agents in order to find an optimal solution. The approach and the results reported in this paper are an initial attempt to investigate possible solution methods for networks of SAs.

Keywords

Local Search Constraint Satisfaction Constraint Satisfaction Problem Global Constraint Central Agent 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bellicha, A.: Maintenance of Solution in a Dynamic Constraint Satisfaction Problem. In: Proc. Applic. Artif. Intell. Engng VIII, Toulouse, France, pp. 261–274 (1993) Google Scholar
  2. 2.
    Bessière, C.: Arc-Consistency in Dynamic Constraint Satisfaction Problems. In: Proc. 9th Natl Conf. Artif. Intell., Anaheim, CA, pp. 221–226 (1991) Google Scholar
  3. 3.
    Bessière, C.: Arc-Consistency for Non-binary Dynamic CSPs. In: Proc. 10th Eur. Conf. Artif. Intell., Vienna, Austria, pp. 23–27 (1992) Google Scholar
  4. 4.
    Bessière, C., Maestre, A., Messeguer, P.: Distributed Dynamic Backtracking. In: Workshop Distrib. Constraint, IJCAI 2001 (2001)Google Scholar
  5. 5.
    Dechter, R., Dechter, A.: Belief Maintenance in Dynamic Constraint Networks. In: Proc. 7th Annu. Conf. Am. Assoc. Artif. Intell., pp. 37–42 (1988) Google Scholar
  6. 6.
    Hamadi, Y., Bessière, C.: Backtracking in Distributed Constraint Networks. In: Proc. ECAI 1998, Brighton, pp. 219–223 (August 1998) Google Scholar
  7. 7.
    Lamma, E., Mello, P., Milano, M., Cucchiara, R., Gavanelli, M., Piccardi, M.: Constraint Propagation and Value Acquisition: Why We Should Do It Interactively. In: Dean, T. (ed.) Proc. Int. Joint Conf. Artif. Intell., JCAI 1999, Stockholm, Sweden, pp. 468–477. Morgan Kaufmann, San Mateo (1999)Google Scholar
  8. 8.
    Macho-Gonzalez, S., Faltings, B.: Open Constraint Satisfaction. In: Proc. AAMAS 2002 Workshop Distrib. Constraint Satisfaction (2002) Google Scholar
  9. 9.
    Meisels, A., Schaerf, A.: Modelling and Solving Employee Timetabling Problems. Ann. Math. Artif. Intell. (to appear) Google Scholar
  10. 10.
    Meisels, A., Schaerf, A.: Solving employee timetabling problems by generalized local search. In: Proc. Ital. AI-1, Bologna, Italy, pp. 281–331 (May 1999) Google Scholar
  11. 11.
    Meseguer, P., Jimenez, M.A.: Distributed Forward Checking. In: Proc. CP 2000 Workshop Distrib. Constraint Satisfaction, Singapore (September 2000) Google Scholar
  12. 12.
    Prosser, P.: Hybrid Algorithms for the Constraint Satisfaction Problem. Comput. Intell. 9, 268–299 (1993)CrossRefGoogle Scholar
  13. 13.
    Richards, E.B., Das, S., Choi, H., El-Kholy, A., Liatsos, V., Harrison, C.: Distributed Optimisation: a Case study of Utilising Teaching Space in a College. In: Proc. Expert Syst. 1996 Conf., Cambridge, pp. 153–161. SGES Publications (1996)Google Scholar
  14. 14.
    Meisels, A., Schaerf, A.: Solving employee timetabling problems by generalized local search. In: Proc. Ital. AI-1, Bologna, Italy, pp. 493–502 (May 1999) Google Scholar
  15. 15.
    Silaghi, M.C., Stefan, S., Sam-Haroud, D., Faltings, B.: Asynchronous Search for Numeric DisCSPs. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, p. 785. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  16. 16.
    Solotorevsky, G., Gudes, E., Meisels, A.: Modeling and Solving Distributed Constraint Satisfaction Problems (DCSPs). In: Constraint Processing 1996, New Hampshire (October 1996) Google Scholar
  17. 17.
    Nguyen, T., Deville, Y.: A Distributed Arc-Consistency Algorithm. Sci. Comput. Program. 30, 227–250 (1998)zbMATHCrossRefMathSciNetGoogle Scholar
  18. 18.
    Verfaillie, G., Schiex, T.: Solution Reuse in Dynamic Constraint Satisfaction Problems. In: Proc. 12th Natl Conf. Artif. Intell., Seattle, WA (1994) Google Scholar
  19. 19.
    Yokoo, M.: Distributed Constraint Satisfaction: Foundations of Cooperation in Multi-agent Systems. Springer, Heidelberg (2001)zbMATHGoogle Scholar
  20. 20.
    Yokoo, M., Durfee, E.H., Ishida, T., Kuwabara, K.: Distributed Constraint Satisfaction Problem: Formalization and Algorithms. IEEE Trans. Data Knowl. Engng. 10, 673–685 (1998)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Amnon Meisels
    • 1
  • Eliezer Kaplansky
    • 1
  1. 1.Department of Computer ScienceBen-Gurion University of the NegevBeer-ShevaIsrael

Personalised recommendations