Scheduling Algorithm Using Path Relinking for Production Process with Crane Interference

Takashi Tanizaki, K. Yamada, Shigemasa Nakagawa, H. Katagiri
{"title":"Scheduling Algorithm Using Path Relinking for Production Process with Crane Interference","authors":"Takashi Tanizaki, K. Yamada, Shigemasa Nakagawa, H. Katagiri","doi":"10.20965/ijat.2023.p0071","DOIUrl":null,"url":null,"abstract":"In manufacturing industries, customers demand a wide variety of products, with high quality and fast delivery. Production scheduling systems have become critical for efficient operation. However, scheduling problems in manufacturing are generally large and complex with many constraints. It is difficult to create an optimal production schedule that satisfies all constraints within a reasonable timeframe. This study targets a factory with multiple working machines and two overhead cranes. Our research aims to obtain a solution algorithm to avoid interference of overhead cranes and machine competition and a production plan that minimizes the total makespan for each job. As the problem must be solved within a reasonable timeframe, we have developed the solution algorithm using metaheuristics and scheduling simulation. In general, metaheuristic algorithms must strike a balance between an intensive search for good solutions and a search for diverse solutions. Accordingly, we propose a new algorithm using path relinking in a scatter search. This method was demonstrated to be effective in obtaining good solutions with little variation in numerical experiments. In this paper, we describe previous research, our target process, and new solution algorithm and discuss algorithm design methods based on computer experiments.","PeriodicalId":13583,"journal":{"name":"Int. J. Autom. Technol.","volume":"136 1","pages":"71-80"},"PeriodicalIF":0.0000,"publicationDate":"2023-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Autom. Technol.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.20965/ijat.2023.p0071","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In manufacturing industries, customers demand a wide variety of products, with high quality and fast delivery. Production scheduling systems have become critical for efficient operation. However, scheduling problems in manufacturing are generally large and complex with many constraints. It is difficult to create an optimal production schedule that satisfies all constraints within a reasonable timeframe. This study targets a factory with multiple working machines and two overhead cranes. Our research aims to obtain a solution algorithm to avoid interference of overhead cranes and machine competition and a production plan that minimizes the total makespan for each job. As the problem must be solved within a reasonable timeframe, we have developed the solution algorithm using metaheuristics and scheduling simulation. In general, metaheuristic algorithms must strike a balance between an intensive search for good solutions and a search for diverse solutions. Accordingly, we propose a new algorithm using path relinking in a scatter search. This method was demonstrated to be effective in obtaining good solutions with little variation in numerical experiments. In this paper, we describe previous research, our target process, and new solution algorithm and discuss algorithm design methods based on computer experiments.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
考虑起重机干扰的生产过程路径重链接调度算法
在制造业中,客户需要各种各样的产品,高质量和快速交货。生产调度系统已成为高效运行的关键。然而,制造业中的调度问题通常是庞大而复杂的,并且有许多约束条件。要在合理的时间框架内制定出满足所有限制条件的最佳生产计划是很困难的。本研究以具有多台工作机器和两台桥式起重机的工厂为研究对象。我们的研究目标是获得一种避免桥式起重机和机器竞争干扰的求解算法和一种使每个作业总完工时间最小化的生产计划。由于问题必须在合理的时间框架内解决,我们开发了使用元启发式和调度仿真的解决算法。一般来说,元启发式算法必须在密集搜索好的解决方案和搜索多种解决方案之间取得平衡。在此基础上,提出了一种基于路径链接的散点搜索算法。数值实验结果表明,该方法能有效地得到变化小的好解。本文介绍了以往的研究、目标过程和新的求解算法,并讨论了基于计算机实验的算法设计方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Advantages of Injection Mold with Hybrid Process of Metal Powder Bed Fusion and Subtractive Process Experimental Investigation of Spatter Particle Behavior and Improvement in Build Quality in PBF-LB Process Planning with Removal of Melting Penetration and Temper Colors in 5-Axis Hybrid Additive and Subtractive Manufacturing Technique for Introducing Internal Defects with Arbitrary Sizes and Locations in Metals via Additive Manufacturing and Evaluation of Fatigue Properties Editorial: Recent Trends in Additive Manufacturing
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1