GA with Special Encoded Chromosome for FJSP with Machine Disruptions

H. Yin
{"title":"GA with Special Encoded Chromosome for FJSP with Machine Disruptions","authors":"H. Yin","doi":"10.1109/CIS.2013.70","DOIUrl":null,"url":null,"abstract":"Flexible job shop scheduling problem(s) (FJSP) were study and discussed in large amount. However, it is still far from a real-world manufacturing environment, in which disruptions such as machine failure must be taken into account. The goal of this paper is to create a genetic algorithm (GA) with very special chromosome encoding to handle FJSP that can adapt to disruption to reflect more closely the real-world manufacturing environment. We hope that by using just-in-time machine assignment and adapting scheduling rules, we can achieve the robustness and flexibility we desire. After detailed algorithm design and description, experiments were carried out. In the experiments, we compared our novel approach to two benchmark algorithms: a right-shifting reschedule and a prescheduled. A right-shifting reschedule repairs schedules by delaying affected operations until the disruption is over. A prescheduled works on each disruption scenario separately, treating disruptions like prescheduled downtime. Experiments showed that our approach was able to adapt to disruptions in a manner that minimized lost time than compared benchmark algorithms.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"62 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 Ninth International Conference on Computational Intelligence and Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIS.2013.70","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Flexible job shop scheduling problem(s) (FJSP) were study and discussed in large amount. However, it is still far from a real-world manufacturing environment, in which disruptions such as machine failure must be taken into account. The goal of this paper is to create a genetic algorithm (GA) with very special chromosome encoding to handle FJSP that can adapt to disruption to reflect more closely the real-world manufacturing environment. We hope that by using just-in-time machine assignment and adapting scheduling rules, we can achieve the robustness and flexibility we desire. After detailed algorithm design and description, experiments were carried out. In the experiments, we compared our novel approach to two benchmark algorithms: a right-shifting reschedule and a prescheduled. A right-shifting reschedule repairs schedules by delaying affected operations until the disruption is over. A prescheduled works on each disruption scenario separately, treating disruptions like prescheduled downtime. Experiments showed that our approach was able to adapt to disruptions in a manner that minimized lost time than compared benchmark algorithms.
基于特殊编码染色体的遗传算法求解机器干扰FJSP
对柔性作业车间调度问题进行了大量的研究和讨论。然而,它与现实世界的制造环境仍然相去甚远,在现实世界中,必须考虑到机器故障等中断。本文的目标是创建一个具有非常特殊的染色体编码的遗传算法(GA)来处理FJSP,该算法可以适应中断,以更紧密地反映现实世界的制造环境。我们希望通过使用即时机器分配和自适应调度规则来实现我们所期望的鲁棒性和灵活性。经过详细的算法设计和描述,进行了实验。在实验中,我们将我们的新方法与两种基准算法进行了比较:右移重新调度和预先调度。右移重新安排通过延迟受影响的操作来修复计划,直到中断结束。预先安排的工作分别针对每个中断场景,将中断视为预先安排的停机时间。实验表明,与基准算法相比,我们的方法能够以最小化损失时间的方式适应中断。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信