Development of a Hybrid Flowshop Scheduling System Considering with Due-Date and Incontrollable Processing Time for MTO Production

Kenta Shinoda, Kakeru Onodera, S. Arima
{"title":"Development of a Hybrid Flowshop Scheduling System Considering with Due-Date and Incontrollable Processing Time for MTO Production","authors":"Kenta Shinoda, Kakeru Onodera, S. Arima","doi":"10.1109/IIAI-AAI.2018.00135","DOIUrl":null,"url":null,"abstract":"This research reported the automation and optimization of hybrid flexible flowshop scheduling (HFS) for make-to-order (MTO) production, particularly for a joint research with a Japanese medium-sized company. As the first, an automated scheduling software was developed to compare several basic and advanced rules for HFS. Secondly, the optimal solution was discussed to involve both a due-date of individual job and the efficiency of parallel machines in HFS for MTO. Gupta algorithm (1988) was extended considering with different processing time of the individual job. As the result of performance evaluations for actual cases, extended Gupta method improved the due-date satisfaction rate by 15% more than the typical rules, while keeping short makespan that means machines are effectively utilized beyond process steps. In addition, computation of the proposed method is very quick (less than 0.04 seconds) even to the problem consisting of 5 machines and around 110 jobs.","PeriodicalId":309975,"journal":{"name":"2018 7th International Congress on Advanced Applied Informatics (IIAI-AAI)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 7th International Congress on Advanced Applied Informatics (IIAI-AAI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IIAI-AAI.2018.00135","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This research reported the automation and optimization of hybrid flexible flowshop scheduling (HFS) for make-to-order (MTO) production, particularly for a joint research with a Japanese medium-sized company. As the first, an automated scheduling software was developed to compare several basic and advanced rules for HFS. Secondly, the optimal solution was discussed to involve both a due-date of individual job and the efficiency of parallel machines in HFS for MTO. Gupta algorithm (1988) was extended considering with different processing time of the individual job. As the result of performance evaluations for actual cases, extended Gupta method improved the due-date satisfaction rate by 15% more than the typical rules, while keeping short makespan that means machines are effectively utilized beyond process steps. In addition, computation of the proposed method is very quick (less than 0.04 seconds) even to the problem consisting of 5 machines and around 110 jobs.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
考虑交货期和加工时间不可控的MTO混合流程车间调度系统的开发
本研究报告了用于按订单生产(MTO)的混合柔性流程车间调度(HFS)的自动化和优化,特别是与一家日本中型公司的联合研究。作为第一个,开发了一个自动调度软件来比较HFS的几个基本规则和高级规则。其次,讨论了MTO下HFS中单个作业的交货期和并联机床的效率的最优解。考虑到单个作业处理时间的不同,对Gupta算法(1988)进行了扩展。通过对实际案例的绩效评估,扩展的Gupta方法比典型规则的截止日期满意率提高了15%,同时保持了较短的完工时间,这意味着机器在过程步骤之外得到了有效的利用。此外,该方法的计算速度非常快(小于0.04秒),即使是由5台机器和大约110个作业组成的问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Finding High Quality Documents through Link and Click Graphs Seamless Support for International Students' Job Hunting in Japan Using Learning Log System and eBook Message from Program Chair Internet Based Interactive Transcription Support System for Woodblock-Printed Japanese Historical Book Images Common Sensing and Analyses to Visualize a Production Process with Parallelly Utilized Resource - Job-Shop and Flow-Shop Cases
×
引用
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