A distributed asynchronous system for predictive and reactive scheduling

Abstract In DAS, the distributed asynchronous scheduler, the scheduling problem is decomposed both functionally and spatially across a hierarchy of communicating agents where each agent exhibits the properties of opportunism, reaction and belief maintenance. Each agent corresponds to a distinct software process, all of which may run concurrently. To be able to work towards a global solution each agent may react to change induced upon it by other agents and is able to negotiate with agents. The external world is treated as an agent with one exceptional property, negotiation is disallowed. The system is disciplined such that problem solving effort can be dynamically focused and decision making synchronized. DAS does not differentiate between prediction and reaction. By retaining knowledge of the search space explored and the remaining opportunities, reaction is considered as a continuation of search or conversely prediction is considered as a series of reactions.

[1]  Rina Dechter,et al.  Learning While Searching in Constraint-Satisfaction-Problems , 1986, AAAI.

[2]  Juha Hynynen A framework for coordination in distributed production management , 1988 .

[3]  Jean-François Rit,et al.  Propagating Temporal Constraints for Scheduling , 1986, AAAI.

[4]  Alan K. Mackworth Consistency in Networks of Relations , 1977, Artif. Intell..

[5]  Ernest Davis,et al.  Constraint Propagation with Interval Labels , 1987, Artif. Intell..

[6]  H. V. Parunak Chapter 10 – Manufacturing Experience with the Contract Net , 1987 .

[7]  Johan de Kleer,et al.  An Assumption-Based TMS , 1987, Artif. Intell..

[8]  Stephen F. Smith,et al.  A Probabilistic Framework for Resource-Constrained Multi-Agent Planning , 1987, IJCAI.

[9]  Randall Davis,et al.  Negotiation as a Metaphor for Distributed Problem Solving , 1988, Artif. Intell..

[10]  Victor R. Lesser,et al.  Functionally Accurate, Cooperative Distributed Systems , 1988, IEEE Transactions on Systems, Man, and Cybernetics.

[11]  Karl G. Kempf,et al.  Complexity, Uncertainty, and Opportunistic Scheduling , 1985, Conference on Artificial Intelligence Applications.

[12]  Claude Le Pape,et al.  SONIA: A knowledge-based scheduling system , 1988, Artif. Intell. Eng..

[13]  Richard C. T. Lee,et al.  Symbolic logic and mechanical theorem proving , 1973, Computer science classics.

[14]  Patrick Prosser,et al.  A Reactive Scheduling Agent , 1989, IJCAI.

[15]  J. Dekleer An assumption-based TMS , 1986 .

[16]  Peter Burke,et al.  Scheduling in dynamic environments , 1989 .

[17]  James F. Allen Towards a General Theory of Action and Time , 1984, Artif. Intell..

[18]  Mark S. Fox,et al.  Constraint-Directed Search: A Case Study of Job-Shop Scheduling , 1987 .

[19]  Victor R. Lesser,et al.  The Hearsay-II Speech-Understanding System: Integrating Knowledge to Resolve Uncertainty , 1980, CSUR.

[20]  Edmund H. Durfee,et al.  Cooperation through communication in a distributed problem-solving network , 1990 .

[21]  Eugene C. Freuder,et al.  The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problems , 1985, Artif. Intell..

[22]  Carl Hewitt,et al.  Viewing Control Structures as Patterns of Passing Messages , 1977, Artif. Intell..