带路由缓冲区的客车制造车间调度方法

Zhonghua Han, Jingyuan Zhang, Xiaoting Dong, Yuanwei Qi
{"title":"带路由缓冲区的客车制造车间调度方法","authors":"Zhonghua Han, Jingyuan Zhang, Xiaoting Dong, Yuanwei Qi","doi":"10.1504/ijspm.2020.10029336","DOIUrl":null,"url":null,"abstract":"Aiming at solving the problem that the moving route is complicated and the scheduling is difficult in the routing buffer of the bus in the manufacturing workshop, a routing buffer mathematical programming model for bus manufacturing workshop is proposed. We design a moving approach for minimizing the total setup cost for moving in routing buffer. The framework and the solution ofthe optimization problem of such a bus manufacturing workshop scheduling with routing buffer arepresented. The evaluation results show that, comparing with the irregularly guided moving method, the proposed method can better guide the bus movement in routing buffer by reducing the total setup time of all buses processed at the next stage, and obtaining a better scheduling optimization solution with minimize maximum total completion time.","PeriodicalId":266151,"journal":{"name":"Int. J. Simul. Process. Model.","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Bus Manufacturing Workshop Scheduling Method with Routing Buffer\",\"authors\":\"Zhonghua Han, Jingyuan Zhang, Xiaoting Dong, Yuanwei Qi\",\"doi\":\"10.1504/ijspm.2020.10029336\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Aiming at solving the problem that the moving route is complicated and the scheduling is difficult in the routing buffer of the bus in the manufacturing workshop, a routing buffer mathematical programming model for bus manufacturing workshop is proposed. We design a moving approach for minimizing the total setup cost for moving in routing buffer. The framework and the solution ofthe optimization problem of such a bus manufacturing workshop scheduling with routing buffer arepresented. The evaluation results show that, comparing with the irregularly guided moving method, the proposed method can better guide the bus movement in routing buffer by reducing the total setup time of all buses processed at the next stage, and obtaining a better scheduling optimization solution with minimize maximum total completion time.\",\"PeriodicalId\":266151,\"journal\":{\"name\":\"Int. J. Simul. Process. Model.\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-03-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Simul. Process. Model.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1504/ijspm.2020.10029336\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Simul. Process. Model.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/ijspm.2020.10029336","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

针对制造车间客车路由缓冲区中移动路线复杂、调度困难的问题,提出了一种客车制造车间路由缓冲区数学规划模型。我们设计了一种移动方法,以最小化在路由缓冲区中移动的总设置成本。给出了带路由缓冲区的客车制造车间调度优化问题的框架和求解方法。评价结果表明,与不规则引导移动方法相比,该方法通过减少下一阶段处理的所有公交车的总设置时间,能够更好地引导公交在路由缓冲区中的运动,获得最大总完成时间最小的更好的调度优化方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Bus Manufacturing Workshop Scheduling Method with Routing Buffer
Aiming at solving the problem that the moving route is complicated and the scheduling is difficult in the routing buffer of the bus in the manufacturing workshop, a routing buffer mathematical programming model for bus manufacturing workshop is proposed. We design a moving approach for minimizing the total setup cost for moving in routing buffer. The framework and the solution ofthe optimization problem of such a bus manufacturing workshop scheduling with routing buffer arepresented. The evaluation results show that, comparing with the irregularly guided moving method, the proposed method can better guide the bus movement in routing buffer by reducing the total setup time of all buses processed at the next stage, and obtaining a better scheduling optimization solution with minimize maximum total completion time.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信