针对专家系统的调度问题

K. Satoh, F. Honda, H. Hara, H. Matsumoto
{"title":"针对专家系统的调度问题","authors":"K. Satoh, F. Honda, H. Hara, H. Matsumoto","doi":"10.1109/AIIA.1988.13353","DOIUrl":null,"url":null,"abstract":"A framework is described which consists of the concepts of machines and jobs. In this framework, two methods for solving scheduling problems are proposed. The first method, called the heuristic placement method, selects a job using a heuristic algorithm, and then determines the position on time sequence, of machine processing. The second method, called the shakedown and compaction method, is an interactive improvement method. This method formulates initial job sequences by relaxing several constraints. Simple iterative operations are then used to improve job sequences for satisfying all constraints. Experimental results are presented on both of these methods. In addition, a system which consists of a job-modifier and a job-allocator is described.<<ETX>>","PeriodicalId":112397,"journal":{"name":"Proceedings of the International Workshop on Artificial Intelligence for Industrial Applications","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Toward the expert system for scheduling problems\",\"authors\":\"K. Satoh, F. Honda, H. Hara, H. Matsumoto\",\"doi\":\"10.1109/AIIA.1988.13353\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A framework is described which consists of the concepts of machines and jobs. In this framework, two methods for solving scheduling problems are proposed. The first method, called the heuristic placement method, selects a job using a heuristic algorithm, and then determines the position on time sequence, of machine processing. The second method, called the shakedown and compaction method, is an interactive improvement method. This method formulates initial job sequences by relaxing several constraints. Simple iterative operations are then used to improve job sequences for satisfying all constraints. Experimental results are presented on both of these methods. In addition, a system which consists of a job-modifier and a job-allocator is described.<<ETX>>\",\"PeriodicalId\":112397,\"journal\":{\"name\":\"Proceedings of the International Workshop on Artificial Intelligence for Industrial Applications\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-05-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the International Workshop on Artificial Intelligence for Industrial Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AIIA.1988.13353\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the International Workshop on Artificial Intelligence for Industrial Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AIIA.1988.13353","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

描述了一个由机器和作业概念组成的框架。在此框架下,提出了两种求解调度问题的方法。第一种方法称为启发式布置法,利用启发式算法选择作业,然后确定机器加工在时间序列上的位置。第二种方法称为安定和压实法,是一种交互式改进方法。该方法通过放宽几个约束条件来确定初始作业序列。然后使用简单的迭代操作来改进作业序列以满足所有约束。给出了两种方法的实验结果。此外,还描述了一个由作业修改器和作业分配器组成的系统。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Toward the expert system for scheduling problems
A framework is described which consists of the concepts of machines and jobs. In this framework, two methods for solving scheduling problems are proposed. The first method, called the heuristic placement method, selects a job using a heuristic algorithm, and then determines the position on time sequence, of machine processing. The second method, called the shakedown and compaction method, is an interactive improvement method. This method formulates initial job sequences by relaxing several constraints. Simple iterative operations are then used to improve job sequences for satisfying all constraints. Experimental results are presented on both of these methods. In addition, a system which consists of a job-modifier and a job-allocator is described.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信