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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bellicha, A.: Maintenance of Solution in a Dynamic Constraint Satisfaction Problem. In: Proc. Applic. Artif. Intell. Engng VIII, Toulouse, France, pp. 261–274 (1993)
Bessière, C.: Arc-Consistency in Dynamic Constraint Satisfaction Problems. In: Proc. 9th Natl Conf. Artif. Intell., Anaheim, CA, pp. 221–226 (1991)
Bessière, C.: Arc-Consistency for Non-binary Dynamic CSPs. In: Proc. 10th Eur. Conf. Artif. Intell., Vienna, Austria, pp. 23–27 (1992)
Bessière, C., Maestre, A., Messeguer, P.: Distributed Dynamic Backtracking. In: Workshop Distrib. Constraint, IJCAI 2001 (2001)
Dechter, R., Dechter, A.: Belief Maintenance in Dynamic Constraint Networks. In: Proc. 7th Annu. Conf. Am. Assoc. Artif. Intell., pp. 37–42 (1988)
Hamadi, Y., Bessière, C.: Backtracking in Distributed Constraint Networks. In: Proc. ECAI 1998, Brighton, pp. 219–223 (August 1998)
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)
Macho-Gonzalez, S., Faltings, B.: Open Constraint Satisfaction. In: Proc. AAMAS 2002 Workshop Distrib. Constraint Satisfaction (2002)
Meisels, A., Schaerf, A.: Modelling and Solving Employee Timetabling Problems. Ann. Math. Artif. Intell. (to appear)
Meisels, A., Schaerf, A.: Solving employee timetabling problems by generalized local search. In: Proc. Ital. AI-1, Bologna, Italy, pp. 281–331 (May 1999)
Meseguer, P., Jimenez, M.A.: Distributed Forward Checking. In: Proc. CP 2000 Workshop Distrib. Constraint Satisfaction, Singapore (September 2000)
Prosser, P.: Hybrid Algorithms for the Constraint Satisfaction Problem. Comput. Intell. 9, 268–299 (1993)
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)
Meisels, A., Schaerf, A.: Solving employee timetabling problems by generalized local search. In: Proc. Ital. AI-1, Bologna, Italy, pp. 493–502 (May 1999)
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)
Solotorevsky, G., Gudes, E., Meisels, A.: Modeling and Solving Distributed Constraint Satisfaction Problems (DCSPs). In: Constraint Processing 1996, New Hampshire (October 1996)
Nguyen, T., Deville, Y.: A Distributed Arc-Consistency Algorithm. Sci. Comput. Program. 30, 227–250 (1998)
Verfaillie, G., Schiex, T.: Solution Reuse in Dynamic Constraint Satisfaction Problems. In: Proc. 12th Natl Conf. Artif. Intell., Seattle, WA (1994)
Yokoo, M.: Distributed Constraint Satisfaction: Foundations of Cooperation in Multi-agent Systems. Springer, Heidelberg (2001)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Meisels, A., Kaplansky, E. (2003). Scheduling Agents – Distributed Timetabling Problems. In: Burke, E., De Causmaecker, P. (eds) Practice and Theory of Automated Timetabling IV. PATAT 2002. Lecture Notes in Computer Science, vol 2740. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45157-0_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-45157-0_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40699-0
Online ISBN: 978-3-540-45157-0
eBook Packages: Springer Book Archive