PAMS: A Domain‐specific Knowledge‐based Parallel Machine Scheduling System
Authors:
- 1 August 1988
- journal article
- Published by Wiley in Expert Systems
- Vol. 5 (3) , 198-214
Abstract
To overcome the inefficiency of domain independent tools, a domain‐specific knowledge‐based shell for parallel machine scheduling problems, PAMS (PArallel Machine Scheduling System), is proposed. PAMS has the following features; mixed knowledge representation, two‐stage status‐driven control strategy, conflict resolution using domain theory, domain‐specific syntax and primitive operators, interface with database, domain‐specific input/output interface, interactive scheduling capability, built‐in heuristic knowledge, multiple levels of schedule, and expansibility of the domain. A prototype of PAMS, PAMS‐1, is developed using C‐language on a supermicrocomputer, and the performance of PAMS‐1 is evaluated. The results show that the PAMS‐1 performs very well from various perspectives.Keywords
This publication has 19 references indexed in Scilit:
- Expert systems in production schedulingEuropean Journal of Operational Research, 1987
- Lessons for O.R. from A.I.: A Scheduling Case StudyJournal of the Operational Research Society, 1986
- A Review of Production SchedulingOperations Research, 1981
- Artificial Intelligence in Manufacturing Planning and ControlA I I E Transactions, 1980
- Interactive Scheduling: Historical Survey and State of the ArtA I I E Transactions, 1978
- Scheduling on Parallel Machines to Minimize Two Criteria Related to Job TardinessA I I E Transactions, 1977
- An Improved Algorithm for Scheduling Jobs on Identical MachinesA I I E Transactions, 1977
- Scheduling Jobs on a Number of Identical MachinesA I I E Transactions, 1974
- Scheduling with parallel processors and linear delay costsNaval Research Logistics Quarterly, 1973
- Scheduling with Deadlines and Loss FunctionsManagement Science, 1959