Design problem solving: a task analysis
AI Magazine
Artificial Intelligence - Special issue on knowledge representation
International Journal of Human-Computer Studies - Special issue: the Sisyphus-VT initiative
Domain-oriented library of scheduling methods: design principle and real-life application
International Journal of Human-Computer Studies
Constraint-directed techniques for scheduling alternative activities
Artificial Intelligence
Computer science as empirical inquiry: symbols and search
Communications of the ACM
Reusable Components for Knowledge Modelling: Case Studies in Parametric Design Problem Solving
Reusable Components for Knowledge Modelling: Case Studies in Parametric Design Problem Solving
Automating Knowledge Acquisition for Expert Systems
Automating Knowledge Acquisition for Expert Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Making Role Limiting Shells More Flexible
Proceedings of the 7th European Workshop on Knowledge Acquisition for Knowledge-Based Systems
Using Generalised Directive Models in Knowledge Acquisition
Proceedings of the 6th European Knowledge Acquisition Workshop on Current Developments in Knowledge Acquisition: EKAW '92
A Generic Library of Problem Solving Methods for Scheduling Applications
IEEE Transactions on Knowledge and Data Engineering
AI Communications - Agents Applied in Health Care
A logic-oriented wafer fab lot scheduling knowledge-based system
ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
Hi-index | 0.00 |
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.