柔性制造系统的预测控制

S. Engell
{"title":"柔性制造系统的预测控制","authors":"S. Engell","doi":"10.1109/CDC.1989.70073","DOIUrl":null,"url":null,"abstract":"Consideration is given to the dynamic scheduling problem in flexible manufacturing systems. It is assumed that a medium-scale flexible manufacturing system consisting of three to eight machines with overlapping functionality but possibly different effectivity is to be run under the JIT (just-in-time) philosophy. This means that all jobs have to meet their due dates but the starting times of the processing (due dates for delivered parts or previous stages of the production) should be as late as possible. Dynamic online scheduling means that the scheduling algorithms must react to the distances in the production process within short periods of time, typically some seconds to a few minutes. Under this constrain, an exact optimization cannot be achieved because of the enormous complexity of the problem. A mathematical description of the system is presented, and possible approaches to the generation and improvement of suboptimal schedules based on priority rules, and the prediction of the behavior of the system under the regime of such rules, are discussed.<<ETX>>","PeriodicalId":156565,"journal":{"name":"Proceedings of the 28th IEEE Conference on Decision and Control,","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Predictive control of flexible manufacturing systems\",\"authors\":\"S. Engell\",\"doi\":\"10.1109/CDC.1989.70073\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Consideration is given to the dynamic scheduling problem in flexible manufacturing systems. It is assumed that a medium-scale flexible manufacturing system consisting of three to eight machines with overlapping functionality but possibly different effectivity is to be run under the JIT (just-in-time) philosophy. This means that all jobs have to meet their due dates but the starting times of the processing (due dates for delivered parts or previous stages of the production) should be as late as possible. Dynamic online scheduling means that the scheduling algorithms must react to the distances in the production process within short periods of time, typically some seconds to a few minutes. Under this constrain, an exact optimization cannot be achieved because of the enormous complexity of the problem. A mathematical description of the system is presented, and possible approaches to the generation and improvement of suboptimal schedules based on priority rules, and the prediction of the behavior of the system under the regime of such rules, are discussed.<<ETX>>\",\"PeriodicalId\":156565,\"journal\":{\"name\":\"Proceedings of the 28th IEEE Conference on Decision and Control,\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-12-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 28th IEEE Conference on Decision and Control,\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CDC.1989.70073\",\"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 28th IEEE Conference on Decision and Control,","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CDC.1989.70073","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

研究了柔性制造系统中的动态调度问题。假设在JIT (just-in-time)理念下运行由3到8台功能重叠但效率可能不同的机器组成的中等规模柔性制造系统。这意味着所有的工作都必须满足他们的截止日期,但加工的开始时间(交付零件的截止日期或生产的前一个阶段)应该尽可能晚。动态在线调度意味着调度算法必须在短时间内(通常是几秒到几分钟)对生产过程中的距离做出反应。在这种约束下,由于问题的巨大复杂性,无法实现精确的优化。给出了系统的数学描述,并讨论了基于优先级规则生成和改进次优调度的可能方法,以及在这种规则下系统行为的预测。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Predictive control of flexible manufacturing systems
Consideration is given to the dynamic scheduling problem in flexible manufacturing systems. It is assumed that a medium-scale flexible manufacturing system consisting of three to eight machines with overlapping functionality but possibly different effectivity is to be run under the JIT (just-in-time) philosophy. This means that all jobs have to meet their due dates but the starting times of the processing (due dates for delivered parts or previous stages of the production) should be as late as possible. Dynamic online scheduling means that the scheduling algorithms must react to the distances in the production process within short periods of time, typically some seconds to a few minutes. Under this constrain, an exact optimization cannot be achieved because of the enormous complexity of the problem. A mathematical description of the system is presented, and possible approaches to the generation and improvement of suboptimal schedules based on priority rules, and the prediction of the behavior of the system under the regime of such rules, are discussed.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信