A real-time rescheduling heuristic using decentralized knowledge-based decisions for flexible flow shops with unrelated parallel machines

Yi Tan, Mark Aufenanger
{"title":"A real-time rescheduling heuristic using decentralized knowledge-based decisions for flexible flow shops with unrelated parallel machines","authors":"Yi Tan, Mark Aufenanger","doi":"10.1109/INDIN.2011.6034918","DOIUrl":null,"url":null,"abstract":"In a manufacturing planning and control system, a change of system environment or of the production requirements may invalidate the current production schedule. In that case, rescheduling as a self-adaption function of the system is necessary for generating a new schedule, regarding the current state of the production system. This rescheduling process is time critical and normally requires real time solutions. In this paper we present a rescheduling approach with offline self-learning and online self-decision-making abilities. It solves the rescheduling problem of flexible flow shops (FFS) with unrelated parallel machines. The optimality criterion is the makespan. The approach uses a centralized heuristic to guarantee the generation of active schedules. In addition, it integrates a decentralized knowledge-based decision making system in the heuristic. This decision making system can learn from previous scheduling problems and their schedules. Consequently, it uses the obtained knowledge to dynamically select the most appropriate dispatching rule for scheduling the production, depending on the current system state. Computational results show that the proposed approach is superior to only using one single dispatching rule constantly. Furthermore, due to its efficient runtime the approach is suitable for real time applications.","PeriodicalId":378407,"journal":{"name":"2011 9th IEEE International Conference on Industrial Informatics","volume":"78 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 9th IEEE International Conference on Industrial Informatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INDIN.2011.6034918","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

In a manufacturing planning and control system, a change of system environment or of the production requirements may invalidate the current production schedule. In that case, rescheduling as a self-adaption function of the system is necessary for generating a new schedule, regarding the current state of the production system. This rescheduling process is time critical and normally requires real time solutions. In this paper we present a rescheduling approach with offline self-learning and online self-decision-making abilities. It solves the rescheduling problem of flexible flow shops (FFS) with unrelated parallel machines. The optimality criterion is the makespan. The approach uses a centralized heuristic to guarantee the generation of active schedules. In addition, it integrates a decentralized knowledge-based decision making system in the heuristic. This decision making system can learn from previous scheduling problems and their schedules. Consequently, it uses the obtained knowledge to dynamically select the most appropriate dispatching rule for scheduling the production, depending on the current system state. Computational results show that the proposed approach is superior to only using one single dispatching rule constantly. Furthermore, due to its efficient runtime the approach is suitable for real time applications.
基于分散知识决策的柔性流程车间实时重调度启发式算法
在制造计划和控制系统中,系统环境或生产要求的变化可能使当前的生产计划失效。在这种情况下,重新调度作为系统的自适应功能对于根据生产系统的当前状态生成新的调度是必要的。这个重新调度过程是时间关键的,通常需要实时解决方案。在本文中,我们提出了一种具有离线自我学习和在线自我决策能力的重调度方法。该方法解决了具有不相关并行机的柔性流水车间的重调度问题。最优准则是完工时间。该方法使用集中式启发式算法来保证活动调度的生成。此外,它在启发式中集成了一个分散的基于知识的决策系统。这个决策系统可以从以前的调度问题和它们的调度中学习。因此,它利用所获得的知识,根据当前系统状态动态选择最合适的调度规则来调度生产。计算结果表明,该方法优于连续使用单一调度规则。此外,由于其高效的运行时,该方法适用于实时应用程序。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信