The Open UniversitySkip to content

A Generic library of problem-solving methods for scheduling applications

Rajpathak, Dnyanesh; Motta, Enrico; Zdrahal, Zdenek and Roy, Rajkumar (2003). A Generic library of problem-solving methods for scheduling applications. In: International Conference on Formal Ontology in Information Systems, October 2003, Florida, USA.

Full text available as:
PDF (Not Set) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (237Kb)
Google Scholar: Look up in Google Scholar


In this paper we describe a generic library of problem-solving methods (PSMs) for scheduling applications. Although, some attempts have been made in the past at developing libraries of scheduling methods, these only provide limited coverage: in some cases they are specific to a particular scheduling domain; in other cases they simply implement a particular scheduling technique; in other cases they fail to provide the required degree of depth and precision. Our library is based on a structured approach, whereby we first develop a scheduling task ontology, and then construct a task-specific but domain independent model of scheduling problem-solving, which generalises from specific approaches to scheduling problem-solving. Different PSMs are then constructed uniformly by specialising the generic model of scheduling problem-solving. Our library has been evaluated on a number of real-life and benchmark applications to demonstrate its generic and comprehensive nature.

Item Type: Conference Item
Keywords: Scheduling; Ontologies; Problem-solving methods; Knowledge acquisition; Knowledge reuse
Academic Unit/Department: Knowledge Media Institute
Interdisciplinary Research Centre: Centre for Research in Computing (CRC)
Item ID: 6231
Depositing User: Dnyanesh Rajpathak
Date Deposited: 16 Jan 2007
Last Modified: 25 Feb 2016 11:06
Share this page:

Actions (login may be required)

Policies | Disclaimer

© The Open University   + 44 (0)870 333 4340