Open Access
Knowledge-Based Systems Techniques and Applications in Scheduling
Jürgen Sauer
- 01 Jan 1999
23
TL;DR: In this chapter an overview of scheduling problems, techniques to solve scheduling problem, scheduling systems as well as research issues in scheduling is given.
read more
Abstract: Scheduling problems are found in a lot of application domains. Well known is the scheduling of production where manufacturing operations have to be assigned to limited resources like machines, but also other applications are important, e.g., the scheduling of airline crews, space missions, projects in different domains, clinical surgery, even timetabling and processor scheduling include scheduling problems. In general, scheduling deals with the temporal assignment of activities to limited resources where a set of constraints has to be regarded. Due to the exponential size of scheduling problems it is quite difficult to create good or optimal schedules shown by optimized goal functions or other evaluation criteria. But not only the generation of a schedule is a hard problem, even harder - and the normal case in everyday work - is the adaptation of an existing schedule to the changing scheduling environment. The changes include events like resource breakdowns as well as limitations or prescriptions interactively given by the user of the scheduling system. Scheduling systems have been built to support the users in performing their scheduling tasks. The systems include scheduling knowledge as well as presentation and database components. In this chapter an overview of scheduling problems, techniques to solve scheduling problems, scheduling systems as well as research issues in scheduling is given.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A generic library of problem solving methods for scheduling applications
TL;DR: The generic nature of this library is demonstrated by constructing seven methods for scheduling as an alternative specialization of the model, and it is validated on a number of applications to demonstrate its generic nature and effective support for developing scheduling applications.
Integrating planning and scheduling
Antonio Garrido,Federico Barber +1 more
TL;DR: An intuitive way of integrating independent plans and scheduling processes is presented which achieves better performance in the process of solving planning and scheduling problems.
31
A generic task ontology for scheduling applications
Dnyanesh Rajpathak,Enrico Motta,Rajkumar Roy +2 more
- 01 Jan 2001
TL;DR: The aim is to move beyond current brittle approaches to system development to provide firm theoretical and engineering foundations to various classes of knowledge-based applications.
•Proceedings Article
The epistemology of scheduling problems
Enrico Motta,Dnyanesh Rajpathak,Zdenek Zdrahal,Rajkumar Roy +3 more
- 21 Jul 2002
TL;DR: A task ontology is described, which formally characterises the nature of scheduling problems, independently of particular application domains and independently of how the problems can be solved.
16
•Journal Article
A case study for modular plant control
TL;DR: In this article, an agent-based manufacturing controller, inspired by ant social behavior, is presented and discussed, aiming to provide the key engineering concerns on how the impact of variations in production resources, factory organization and planning processes can be smoothly tackled in respect of plant performance criteria.
13
References
•Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
Michael Randolph Garey,David S. Johnson +1 more
- 01 Jan 1979
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Neural computation of decisions in optimization problems
John J. Hopfield,David W. Tank +1 more
TL;DR: Results of computer simulations of a network designed to solve a difficult but well-defined optimization problem-the Traveling-Salesman Problem-are presented and used to illustrate the computational power of the networks.
6K
Optimal two- and three-stage production schedules with setup times included
TL;DR: A simple decision rule is obtained in this paper for the optimal scheduling of the production so that the total elapsed time is a minimum.
Bayesian Reinforcement Learning in Factored POMDPs
Sammie Katt,Frans A. Oliehoek,Christopher Amato +2 more
- 08 May 2019
TL;DR: This paper provides an overview of research and development activities in the field of autonomous agents and multi-agent systems and aims to identify key concepts and applications, and to indicate how they relate to one-another.