A Formal Study of Distributed Meeting Scheduling

Automating routine organizational tasks, such as meeting scheduling, requires a careful balance between the individual (respecting his or her privacy and personal preferences) and the organization (making efficient use of time and other resources). We argue that meeting scheduling is an inherently distributed process, and that negotiating over meetings can be viewed as a distributed search process. Keeping the process tractable requires introducing heuristics to guide distributed schedulers' decisions about what information to exchange and whether or not to propose the same tentative time for several meetings. While we have intuitions about how such heuristics could affect scheduling performance and efficiency, verifying these intuitions requires a more formal model of the meeting schedule problem and process. We present our preliminary work toward this goal, as well as experimental results that validate some of the predictions of our formal model. We also investigate scheduling in overconstrained situations, namely, scheduling of high priority meetings at short notice, which requires cancellation and rescheduling of previously scheduled meetings. Our model provides a springboard into deeper investigations of important issues in distributed artificial intelligence as well, and we outline our ongoing work in this direction.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/42829/1/10726_2004_Article_153020.pd

Working Notes from the 1992 AAAI Spring Symposium on Practical Approaches to Scheduling and Planning

The symposium presented issues involved in the development of scheduling systems that can deal with resource and time limitations. To qualify, a system must be implemented and tested to some degree on non-trivial problems (ideally, on real-world problems). However, a system need not be fully deployed to qualify. Systems that schedule actions in terms of metric time constraints typically represent and reason about an external numeric clock or calendar and can be contrasted with those systems that represent time purely symbolically. The following topics are discussed: integrating planning and scheduling; integrating symbolic goals and numerical utilities; managing uncertainty; incremental rescheduling; managing limited computation time; anytime scheduling and planning algorithms, systems; dependency analysis and schedule reuse; management of schedule and plan execution; and incorporation of discrete event techniques

Engage D2.6 Annual combined thematic workshops progress report (series 2)

The preparation, organisation and conclusions from the thematic challenge workshops, two ad hoc technical workshops, a technical session on data and a MET/ENV workshop held in 2019 and 2020 are described. Partly due to Covid-19, two of the 2020 thematic challenge workshops scheduled to take place at the end of 2020 were re-scheduled to January 2021. We also report on the preparation for these two workshops, while the conclusions will be included in the next corresponding deliverable

The 1995 Goddard Conference on Space Applications of Artificial Intelligence and Emerging Information Technologies

This publication comprises the papers presented at the 1995 Goddard Conference on Space Applications of Artificial Intelligence and Emerging Information Technologies held at the NASA/Goddard Space Flight Center, Greenbelt, Maryland, on May 9-11, 1995. The purpose of this annual conference is to provide a forum in which current research and development directed at space applications of artificial intelligence can be presented and discussed

Complexity in organisations: a conceptual model: executive summary

Industrial organisations face uncertainty created by consumers, suppliers, competitors and other environmental factors. To deal with this uncertainty, managers have to coordinate the resources of the organisation to produce a variety of behaviours that can cope with environmental change. An organisation that does not have sufficient internal complexity to adapt to the environment cannot survive, while, an organisation with excessive complexity would waste resources and might lose its ability to react to the environment. The main objective of the research was to create a model for dealing with complexity and uncertainty in organisations. The initial ideas for the model originated from the literature, particularly in the fields of systems and complexity theory. These initial ideas were developed through a series of five case studies with four companies, namely British Airways, British Midlands International (BMI), HS Marston and the Ford Motor Company. Each case study contributed to the development of the model, as well as providing immediate benefits for the organisations involved. The first three case studies were used in the development of the model, by analysing the way managers made decisions in situations of complexity and uncertainty. For the final two case studies, the model was already developed and it was possible to apply it, using these cases as a means of validation. A summary of the case studies is presented here, highlighting their contributions to the creation and testing of the model. The main innovation of the research was the creation and application of the Complexity-Uncertainty model, a descriptive framework that classifies generic strategies for dealing with complexity and uncertainty in organisations. The model considers five generic strategies: automation, simplification, planning, control and self-organisation, and indicates when each of these strategies can be more effective according to the complexity and uncertainty of the situation. This model can be used as a learning tool to help managers in industry to conceptualise the nature of complexity in their organisation, in relation to the uncertainty in the environment. The model shows managers the range of strategic options that are available under a particular situation, and highlights the benefits and limitations of each of these strategic options. This is intended to help managers make better decisions based on a more holistic understanding of the organisation, its environment and the strategies available

Computer Aided Verification

The open access two-volume set LNCS 11561 and 11562 constitutes the refereed proceedings of the 31st International Conference on Computer Aided Verification, CAV 2019, held in New York City, USA, in July 2019. The 52 full papers presented together with 13 tool papers and 2 case studies, were carefully reviewed and selected from 258 submissions. The papers were organized in the following topical sections: Part I: automata and timed systems; security and hyperproperties; synthesis; model checking; cyber-physical systems and machine learning; probabilistic systems, runtime techniques; dynamical, hybrid, and reactive systems; Part II: logics, decision procedures; and solvers; numerical programs; verification; distributed systems and networks; verification and invariants; and concurrency

Analysing supply chain operation dynamics through logic-based modelling and simulation

Supply Chain Management (SCM) is becoming increasingly important in the modern business world. In order to effectively manage and integrate a supply chain (SC), a deep understanding of overall SC operation dynamics is needed. This involves understanding how the decisions, actions and interactions between SC members affect each other, and how these relate to SC performance and SC disruptions. Achieving such an understanding is not an easy task, given the complex and dynamic nature of supply chains. Existing simulation approaches do not provide an explanation of simulation results, while related work on SC disruption analysis studies SC disruptions separately from SC operation and performance. This thesis presents a logic-based approach for modelling, simulating and explaining SC operation that fills these gaps. SC members are modelled as logicbased intelligent agents consisting of a reasoning layer, represented through business rules, a process layer, represented through business processes and a communication layer, represented through communicative actions. The SC operation model is declaratively formalised, and a rule-based specification is provided for the execution semantics of the formal model, thus driving the simulation of SC operation. The choice of a logic-based approach enables the automated generation of explanations about simulated behaviours. SC disruptions are included in the SC operation model, and a causal model is defined, capturing relationships between different types of SC disruptions and low SC performance. This way, explanations can be generated on causal relationships between occurred SC disruptions and low SC performance. This approach was analytically and empirically evaluated with the participation of SCM and business experts. The results indicate the following: Firstly, the approach is useful, as it allows for higher efficiency, correctness and certainty about explanations of SC operation compared to the case of no automated explanation support. Secondly, it improves the understanding of the domain for non-SCM experts with respect to their correctness and efficiency; the correctness improvement is significantly higher compared to the case of no prior explanation system use, without loss of efficiency. Thirdly, the logic-based approach allows for maintainability and reusability with respect to the specification of SC operation input models, the developed simulation system and the developed explanation system

Computer Aided Verification

The open access two-volume set LNCS 11561 and 11562 constitutes the refereed proceedings of the 31st International Conference on Computer Aided Verification, CAV 2019, held in New York City, USA, in July 2019. The 52 full papers presented together with 13 tool papers and 2 case studies, were carefully reviewed and selected from 258 submissions. The papers were organized in the following topical sections: Part I: automata and timed systems; security and hyperproperties; synthesis; model checking; cyber-physical systems and machine learning; probabilistic systems, runtime techniques; dynamical, hybrid, and reactive systems; Part II: logics, decision procedures; and solvers; numerical programs; verification; distributed systems and networks; verification and invariants; and concurrency