Motta, Enrico; Rajpathak, Dnyanesh; Zdrahal, Zdenek and Roy, Rajkumar
PDF (Not Set)
- Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
|Google Scholar:||Look up in Google Scholar|
Scheduling is a knowledge-intensive task spanning over many activities in day-to-day life. It deals with the temporally-bound assignment of jobs to resources. Although scheduling has been extensively researched in the AI community for the past 30 years, efforts have primarily focused on specific applications, algorithms, or 'scheduling shells' and no comprehensive analysis exists on the nature of scheduling problems, which provides a formal account of what scheduling is, independently of the way scheduling problems can be approached. Research on KBS development by reuse makes use of ontologies, to provide knowledge-level specifications of reusable KBS components. In this paper we describe a task ontology, which formally characterises the nature of scheduling problems, independently of particular application domains and in-dependently of how the problems can be solved. Our results provide a comprehensive, domain-independent and formally specified refer-ence model for scheduling applications. This can be used as the ba-sis for further analyses of the class of scheduling problems and also as a concrete reusable resource to support knowledge acquisition and system development in scheduling applications.
|Item Type:||Conference Item|
|Keywords:||Knowledge modelling; knowledge engineering; ontologies; scheduling|
|Academic Unit/Department:||Knowledge Media Institute|
|Interdisciplinary Research Centre:||Centre for Research in Computing (CRC)|
|Depositing User:||Dnyanesh Rajpathak|
|Date Deposited:||16 Jan 2007|
|Last Modified:||25 Mar 2016 17:19|
|Share this page:|
► Automated document suggestions from open access sources
Download history for this item
These details should be considered as only a guide to the number of downloads performed manually. Algorithmic methods have been applied in an attempt to remove automated downloads from the displayed statistics but no guarantee can be made as to the accuracy of the figures.