Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

A contracting model for flexible distributed scheduling

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

We are interested in building systems of autonomous agents that can automate routine information processing activities in human organizations. Computational infrastructures for cooperative work should contain embedded agents for handling many routine tasks [9], but as the number of agents increases and the agents become geographically and/or conceptually dispersed, supervision of the agents will become increasingly problematic. We argue that agents should be provided with deep domain knowledge that allows them to make quantitatively justifiable decisions, rather than shallow models of users to mimic. In this paper, we use the application domain of distributed meeting scheduling to investigate how agents embodying deeper domain knowledge can choose among alternative strategies for searching their calendars in order to create flexible schedules within reasonable cost.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. A.V. Aho, J.D. Ullman and M. Yannakakis, Modeling communications protocols by automata, in:Proceedings of the 20th Symposium on the Foundations of Computer Science, October, 1979, pp. 267–273.

  2. J.C. Bean, J.R. Birge, J. Mittenthal and C.E. Noon, Matchup scheduling with multiple resources, release dates and disruptions, Operations Research 39, 1991, 470–483.

    Google Scholar 

  3. C.E. Bell, Maintaining project networks in automated artificial intelligence planning, Management Science 35, 1989, 1192–1214.

    Google Scholar 

  4. D. Brand and P. Zafiropulo, On communcating finite-state machines, Journal of the ACM 30, 1983, 323–342.

    Google Scholar 

  5. T.L. Casavant and J.G. Kuhl, A communicating finite automata approach to modeling distributed computation and its application to distributed decision-making, IEEE Transactions on Computers C-39, 1990, 628–639.

    Google Scholar 

  6. S.F. Conry, R.A. Meyer and V.R. Lesser, Multistage negotiation in distributed planning, in:Readings in Distributed Artificial Intelligence, A.H. Bond and L. Gasser, eds., Morgan Kaufman, 1988.

  7. E.W. Davis and J.H. Patterson, A comparison of heuristic and optimum solutions in resource-constrained project scheduling, Management Science 21, 1975, 944–955.

    Google Scholar 

  8. J. Dumond and V.A. Mabert, Evaluating project scheduling and due date assignment procedures: An experimental analysis, Management Science 34, 1988, 101–118.

    Google Scholar 

  9. J. Galegher, R.E. Kraut and C. Egido,Intellectual Teamwork: Social and Technological Foundations of Cooperative Work, Lawrence Erlbaum Associates, Hillsdale, NJ, 1990.

    Google Scholar 

  10. S.C. Graves, A review of production scheduling, Operations Research 29, 1981, 646–675.

    Google Scholar 

  11. R.M. Haralick and G.L. Elliott, Increasing tree search efficiency for constraint satisfaction probems, Artificial Intelligence 14, 1980, 263–313.

    Google Scholar 

  12. P. Maes and R. Kozierok, Learning interface agents, in:Proceedings of the 11th National Conference on Artificial Intelligence, 1993, pp. 459–464.

  13. D.S. Moore and G.P. McCabe,Introduction to the Practice of Statistics, Freeman, New York, 1989.

    Google Scholar 

  14. S.J. Noronha and V.V.S. Sarma, Knowledge-based approaches for scheduling problems: A survey, IEEE Transactions on Knowledge and Data Engineering 3, 1991, 160–171.

    Google Scholar 

  15. J.L. Peterson and A. Silberschatz,Operating System Concepts, Addison-Wesley, Reading, MA, 1985.

    Google Scholar 

  16. S. Sen,Predicting Tradeoffs in Contract-Based Distributed Scheduling, Ph.D. Thesis, University of Michigan, 1993.

  17. S. Sen and E.H. Durfee, A formal study of distributed meeting scheduling: Preliminary results, in:Proceedings of the ACM Conference on Organizational Computing Systems, 1991, pp. 55–68.

  18. S. Sen and E.H. Durfee, A formal analysis of communication and commitment in distributed meeting scheduling, in:Working Papers of the 11th International Workshop on Distributed Artificial Intelligence, 1992, pp. 333–342.

  19. S. Sen and E.H. Durfee, Dependent subtask processing in a contract-net for manufacturing, in:Proceedings of AAAI-93 Workshop on Intelligent Manufacturing Technology, 1993, pp. 7–13.

  20. S. Sen and E.H. Durfee, On the design of an adaptive meeting scheduler, in:Proceedings of the 10th IEEE Conference on AI Applications, 1994, pp. 40–46.

  21. S. Sen and E.H. Durfee, The role of commitment in cooperative negotiation, International Journal of Intelligent and Cooperative Information Systems 3, 1994, 67–81.

    Google Scholar 

  22. R.G. Smith, The contract net protocol: High-level communication and control in a distributed problem solver, IEEE Transactions on Computers C-29, 1980, 1104–1113.

    Google Scholar 

  23. K. Sugihara, T. Kikuno and N. Yoshida, A meeting scheduler for office automation, IEEE Transactions on Software Engineering 15, 1989, 1141–1146.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sen, S., Durfee, E.H. A contracting model for flexible distributed scheduling. Ann Oper Res 65, 195–222 (1996). https://doi.org/10.1007/BF02187332

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02187332

Keywords