一般队列时间限制下具有返工的混合流车间调度机制

IF 1.9 3区 工程技术 Q3 ENGINEERING, MANUFACTURING
Yoon-Jae Cho, Hyeon-Il Kim, Y. Kim, S. Yoo, Byoung-Hee Kim, Dong-Ho Lee
{"title":"一般队列时间限制下具有返工的混合流车间调度机制","authors":"Yoon-Jae Cho, Hyeon-Il Kim, Y. Kim, S. Yoo, Byoung-Hee Kim, Dong-Ho Lee","doi":"10.1177/09544054231182174","DOIUrl":null,"url":null,"abstract":"This study addresses multi-stage hybrid flow shop scheduling in which a job is reworked if the queue time between two arbitrary stages exceeds an upper limit. The problem is to determine the allocations of jobs to machines at each stage and the start times of jobs and rework setups/operations when incurred. A mixed integer programming model is proposed for each of the makespan and the total tardiness measures. Then, because the problem is NP-hard, a scheduling mechanism is proposed that consists of three phases: (a) filtering the jobs to be delayed; (b) searching the jobs to be reworked; and (c) dispatching non-delayed and delayed jobs sequentially. Simulation results show that the mechanism proposed in this study outperforms the conventional dispatching approach in the high rework setup time case for the makespan problem and low/high setup time cases for the tardiness problem. The best priority rules of the mechanism under each of the measures are also reported.","PeriodicalId":20663,"journal":{"name":"Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture","volume":"49 1","pages":""},"PeriodicalIF":1.9000,"publicationDate":"2023-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A scheduling mechanism for hybrid flow shops with reworks under general queue time limits\",\"authors\":\"Yoon-Jae Cho, Hyeon-Il Kim, Y. Kim, S. Yoo, Byoung-Hee Kim, Dong-Ho Lee\",\"doi\":\"10.1177/09544054231182174\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This study addresses multi-stage hybrid flow shop scheduling in which a job is reworked if the queue time between two arbitrary stages exceeds an upper limit. The problem is to determine the allocations of jobs to machines at each stage and the start times of jobs and rework setups/operations when incurred. A mixed integer programming model is proposed for each of the makespan and the total tardiness measures. Then, because the problem is NP-hard, a scheduling mechanism is proposed that consists of three phases: (a) filtering the jobs to be delayed; (b) searching the jobs to be reworked; and (c) dispatching non-delayed and delayed jobs sequentially. Simulation results show that the mechanism proposed in this study outperforms the conventional dispatching approach in the high rework setup time case for the makespan problem and low/high setup time cases for the tardiness problem. The best priority rules of the mechanism under each of the measures are also reported.\",\"PeriodicalId\":20663,\"journal\":{\"name\":\"Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture\",\"volume\":\"49 1\",\"pages\":\"\"},\"PeriodicalIF\":1.9000,\"publicationDate\":\"2023-06-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://doi.org/10.1177/09544054231182174\",\"RegionNum\":3,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"ENGINEERING, MANUFACTURING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1177/09544054231182174","RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"ENGINEERING, MANUFACTURING","Score":null,"Total":0}
引用次数: 0

摘要

本文研究了多阶段混合流水车间调度问题,当任意两个阶段之间的排队时间超过上限时,作业将被返工。问题是确定每个阶段的作业分配给机器,以及作业的开始时间和发生时的返工设置/操作。针对最大完工时间和总延迟度量,提出了一个混合整数规划模型。然后,由于问题是np困难的,提出了一种调度机制,该机制包括三个阶段:(a)过滤待延迟的作业;(b)查找需要返工的工种;(c)按顺序调度非延迟和延迟作业。仿真结果表明,在最大完工时间问题的高返工准备时间和延迟问题的低/高准备时间情况下,本文提出的调度机制优于传统调度方法。并报告了各措施下该机制的最佳优先规则。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A scheduling mechanism for hybrid flow shops with reworks under general queue time limits
This study addresses multi-stage hybrid flow shop scheduling in which a job is reworked if the queue time between two arbitrary stages exceeds an upper limit. The problem is to determine the allocations of jobs to machines at each stage and the start times of jobs and rework setups/operations when incurred. A mixed integer programming model is proposed for each of the makespan and the total tardiness measures. Then, because the problem is NP-hard, a scheduling mechanism is proposed that consists of three phases: (a) filtering the jobs to be delayed; (b) searching the jobs to be reworked; and (c) dispatching non-delayed and delayed jobs sequentially. Simulation results show that the mechanism proposed in this study outperforms the conventional dispatching approach in the high rework setup time case for the makespan problem and low/high setup time cases for the tardiness problem. The best priority rules of the mechanism under each of the measures are also reported.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
5.10
自引率
30.80%
发文量
167
审稿时长
5.1 months
期刊介绍: Manufacturing industries throughout the world are changing very rapidly. New concepts and methods are being developed and exploited to enable efficient and effective manufacturing. Existing manufacturing processes are being improved to meet the requirements of lean and agile manufacturing. The aim of the Journal of Engineering Manufacture is to provide a focus for these developments in engineering manufacture by publishing original papers and review papers covering technological and scientific research, developments and management implementation in manufacturing. This journal is also peer reviewed. Contributions are welcomed in the broad areas of manufacturing processes, manufacturing technology and factory automation, digital manufacturing, design and manufacturing systems including management relevant to engineering manufacture. Of particular interest at the present time would be papers concerned with digital manufacturing, metrology enabled manufacturing, smart factory, additive manufacturing and composites as well as specialist manufacturing fields like nanotechnology, sustainable & clean manufacturing and bio-manufacturing. Articles may be Research Papers, Reviews, Technical Notes, or Short Communications.
×
引用
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学术官方微信