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

Collaboration, Coordination and Computer Support: An Activity Theoretical Approach to the Design of Computer Supported Cooperative Work. Ph.D. Thesis

This thesis is written in partial satisfaction of the requirements for a Ph.D. in Computer Science performed within the Industrial Research Education Programme established between the University of Aarhus, Kommunedata and Aarhus University Hospital. The initial focus of the project was to investigate ways of supporting the extensive cooperation taking place within a hospital. The theoretical objective of this work is to apply activity theory as a theoretical foundation for CSCW research and to focus on the issue of design within CSCW

Production scheduling

https://egrove.olemiss.edu/aicpa_comm/1116/thumbnail.jp

Human aspects of scheduling : a case study

Thesis (S.M.)--Massachusetts Institute of Technology, Engineering Systems Division, September 2006.Includes bibliographical references (leaves 64-68).This work presents a look at real-life production-floor scheduling, comparing and contrasting it to both normative OR theory and Cognitive Psychology theory. Relevant literature in OR, scheduling and psychology is reviewed, and gaps in theory are pointed out, calling for observation of real-life scheduling and for modeling of the cognitive processes underlying such activities. While normative theory and cognitive psychology theory suggest certain behaviors should be observed, a case study conducted with a large manufacturing company reveals real-life scheduling to be different from behavior expected by OR as well as by cognitive psychology. Future research is suggested, which may enable better modeling of human schedulers.by Yishai Boasson.S.M

Scheduling Problems

Scheduling is defined as the process of assigning operations to resources over time to optimize a criterion. Problems with scheduling comprise both a set of resources and a set of a consumers. As such, managing scheduling problems involves managing the use of resources by several consumers. This book presents some new applications and trends related to task and data scheduling. In particular, chapters focus on data science, big data, high-performance computing, and Cloud computing environments. In addition, this book presents novel algorithms and literature reviews that will guide current and new researchers who work with load balancing, scheduling, and allocation problems

Towards Loosely-Coupled Programming on Petascale Systems

We have extended the Falkon lightweight task execution framework to make loosely coupled programming on petascale systems a practical and useful programming model. This work studies and measures the performance factors involved in applying this approach to enable the use of petascale systems by a broader user community, and with greater ease. Our work enables the execution of highly parallel computations composed of loosely coupled serial jobs with no modifications to the respective applications. This approach allows a new-and potentially far larger-class of applications to leverage petascale systems, such as the IBM Blue Gene/P supercomputer. We present the challenges of I/O performance encountered in making this model practical, and show results using both microbenchmarks and real applications from two domains: economic energy modeling and molecular dynamics. Our benchmarks show that we can scale up to 160K processor-cores with high efficiency, and can achieve sustained execution rates of thousands of tasks per second.Comment: IEEE/ACM International Conference for High Performance Computing, Networking, Storage and Analysis (SuperComputing/SC) 200