基于多保真度模型的MRO调度问题仿真优化

Zewen Huang, J. Ding, Jie Song, Leyuan Shi, Chun-Hung Chen
{"title":"基于多保真度模型的MRO调度问题仿真优化","authors":"Zewen Huang, J. Ding, Jie Song, Leyuan Shi, Chun-Hung Chen","doi":"10.1109/ICIT.2016.7474992","DOIUrl":null,"url":null,"abstract":"Maintenance, repair and overhaul (MRO) are important segments of the remanufacturing industry for the maintenance of complex capital goods. The uncertain processing time and routings make MRO scheduling differ greatly from traditional manufacturing. Simulation optimization is suitable to solve the problems with uncertainty. This work uses multi-fidelity optimization with ordinal transformation and optimal sampling framework to solve a MRO scheduling problem. We build a high-fidelity simulation model which is stochastic and time-consuming. Instead of directly running the high-fidelity model, we provide a deterministic low-fidelity model to transform the original solution space into a one-dimensional ordinal space. The transformed solution space is partitioned into several groups. An efficient optimal computing budget allocation method is used to sample within these groups. Numerical results and comparisons show that this framework is computationally effective to handle those uncertainties, and provides high quality schedules with the low tardiness for the MRO scheduling problem.","PeriodicalId":116715,"journal":{"name":"2016 IEEE International Conference on Industrial Technology (ICIT)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Simulation optimization for the MRO scheduling problem based on multi-fidelity models\",\"authors\":\"Zewen Huang, J. Ding, Jie Song, Leyuan Shi, Chun-Hung Chen\",\"doi\":\"10.1109/ICIT.2016.7474992\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Maintenance, repair and overhaul (MRO) are important segments of the remanufacturing industry for the maintenance of complex capital goods. The uncertain processing time and routings make MRO scheduling differ greatly from traditional manufacturing. Simulation optimization is suitable to solve the problems with uncertainty. This work uses multi-fidelity optimization with ordinal transformation and optimal sampling framework to solve a MRO scheduling problem. We build a high-fidelity simulation model which is stochastic and time-consuming. Instead of directly running the high-fidelity model, we provide a deterministic low-fidelity model to transform the original solution space into a one-dimensional ordinal space. The transformed solution space is partitioned into several groups. An efficient optimal computing budget allocation method is used to sample within these groups. Numerical results and comparisons show that this framework is computationally effective to handle those uncertainties, and provides high quality schedules with the low tardiness for the MRO scheduling problem.\",\"PeriodicalId\":116715,\"journal\":{\"name\":\"2016 IEEE International Conference on Industrial Technology (ICIT)\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-03-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE International Conference on Industrial Technology (ICIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIT.2016.7474992\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE International Conference on Industrial Technology (ICIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIT.2016.7474992","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

维修、修理和大修(MRO)是复杂资本货物维修的再制造行业的重要组成部分。加工时间和工艺路线的不确定性使得MRO调度与传统制造有很大的不同。仿真优化适用于求解具有不确定性的问题。本文采用排序变换的多保真度优化和最优采样框架来解决MRO调度问题。我们建立了一个高保真度的仿真模型,该模型具有随机性和耗时性。我们不直接运行高保真度模型,而是提供一个确定性的低保真度模型,将原始解空间转换为一维有序空间。将变换后的解空间划分为若干组。采用一种高效的最优计算预算分配方法对这些组进行抽样。数值结果和比较表明,该框架能够有效地处理这些不确定性,为MRO调度问题提供低延迟的高质量调度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Simulation optimization for the MRO scheduling problem based on multi-fidelity models
Maintenance, repair and overhaul (MRO) are important segments of the remanufacturing industry for the maintenance of complex capital goods. The uncertain processing time and routings make MRO scheduling differ greatly from traditional manufacturing. Simulation optimization is suitable to solve the problems with uncertainty. This work uses multi-fidelity optimization with ordinal transformation and optimal sampling framework to solve a MRO scheduling problem. We build a high-fidelity simulation model which is stochastic and time-consuming. Instead of directly running the high-fidelity model, we provide a deterministic low-fidelity model to transform the original solution space into a one-dimensional ordinal space. The transformed solution space is partitioned into several groups. An efficient optimal computing budget allocation method is used to sample within these groups. Numerical results and comparisons show that this framework is computationally effective to handle those uncertainties, and provides high quality schedules with the low tardiness for the MRO scheduling problem.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信