{"title":"Knowledge modeling environment for job-shop scheduling problem","authors":"D. Araki, K. Narimatu, S. Kojima","doi":"10.1109/CAIA.1994.323640","DOIUrl":null,"url":null,"abstract":"The scheduling model and method must be designed to be application-domain dependent so as to reflect a set of constraints, objectives and preferences which reside in the target problem. We analyzed the scheduling process of human experts in a knowledge-base level and have developed a task-specific shell named ARES/SCH. ARES/SCH possesses a primitive task library that is a collection of domain-independent and generic components of scheduling mechanisms. The whole scheduling method can be described as a combinational flow-chart of primitive tasks. Memory module mounting shop (MMS) scheduling is shown as an example of ARES/SCH applications. It was apparent that ARES/SCH contributes to the rapid development of scheduling systems and supports a wide range of scheduling domains.<<ETX>>","PeriodicalId":297396,"journal":{"name":"Proceedings of the Tenth Conference on Artificial Intelligence for Applications","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Tenth Conference on Artificial Intelligence for Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CAIA.1994.323640","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The scheduling model and method must be designed to be application-domain dependent so as to reflect a set of constraints, objectives and preferences which reside in the target problem. We analyzed the scheduling process of human experts in a knowledge-base level and have developed a task-specific shell named ARES/SCH. ARES/SCH possesses a primitive task library that is a collection of domain-independent and generic components of scheduling mechanisms. The whole scheduling method can be described as a combinational flow-chart of primitive tasks. Memory module mounting shop (MMS) scheduling is shown as an example of ARES/SCH applications. It was apparent that ARES/SCH contributes to the rapid development of scheduling systems and supports a wide range of scheduling domains.<>