A generic library of problem solving methods for scheduling applications

In this paper we describe a generic library of problemsolving 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 problemsolving. Our library has been evaluated on a number of real-life and benchmark applications to demonstrate its generic and comprehensive nature. Categories and Subject D...

• Type: Conference
• Year: 2003
• Where: KCAP
• Authors: Dnyanesh G. Rajpathak, Enrico Motta, Zdenek Zdráhal, Rajkumar Roy
• Keywords: KCAP 2003, Particular Scheduling, Particular Scheduling Domain, Particular Scheduling Technique