Applications of Hybrid flowshop schedulings under dynamic constraints of queue time and capacities

Motoharu Tanaka, Keita Nishizawa, Tomoki Ohno, Y. Ogawa, S. Arima
{"title":"Applications of Hybrid flowshop schedulings under dynamic constraints of queue time and capacities","authors":"Motoharu Tanaka, Keita Nishizawa, Tomoki Ohno, Y. Ogawa, S. Arima","doi":"10.23919/eMDC/ISSM48219.2019.9052109","DOIUrl":null,"url":null,"abstract":"This paper introduced the hybrid flowshop scheduling (HFS) for a production system including Q-time restrictions or products with individual due-dates such as Make-to-Order products. Two of Gupta's algorithms for 2-step and for n-step hybrid flowshop problem (2010) were extended to consider with the restrictions of queueing time. Those are denoted by Extended-Gupta (2) and Extended-Gupta (n) here. As the result of performance evaluations using actual conditions of target production systems, Both of the Extended algorithms much improved the utilization of machines without deterioration of the due-date satisfaction rate, though ordinal dispatching rules or the original Gupta algorithm results lower utilization or lower due-date satisfaction rate. Extended-Gupta (n) performs better than Extended-Gupta (2) because of its total optimization ability","PeriodicalId":398770,"journal":{"name":"2019 Joint International Symposium on e-Manufacturing & Design Collaboration(eMDC) & Semiconductor Manufacturing (ISSM)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 Joint International Symposium on e-Manufacturing & Design Collaboration(eMDC) & Semiconductor Manufacturing (ISSM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/eMDC/ISSM48219.2019.9052109","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

This paper introduced the hybrid flowshop scheduling (HFS) for a production system including Q-time restrictions or products with individual due-dates such as Make-to-Order products. Two of Gupta's algorithms for 2-step and for n-step hybrid flowshop problem (2010) were extended to consider with the restrictions of queueing time. Those are denoted by Extended-Gupta (2) and Extended-Gupta (n) here. As the result of performance evaluations using actual conditions of target production systems, Both of the Extended algorithms much improved the utilization of machines without deterioration of the due-date satisfaction rate, though ordinal dispatching rules or the original Gupta algorithm results lower utilization or lower due-date satisfaction rate. Extended-Gupta (n) performs better than Extended-Gupta (2) because of its total optimization ability
队列时间和容量动态约束下混合流水车间调度的应用
本文介绍了包含时间限制的生产系统或具有单独交货期的产品(如订制产品)的混合流程车间调度方法。将Gupta的两步和n步混合流车间问题算法(2010)扩展为考虑排队时间的限制。这里用extendedgupta(2)和extendedgupta (n)表示。通过对目标生产系统的实际情况进行性能评价,两种扩展算法均能在不降低交货期满意率的情况下显著提高机器利用率,而顺序调度规则或原始Gupta算法的利用率或交货期满意率较低。Extended-Gupta (n)的总体优化能力优于Extended-Gupta (2)
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信