Two-objective optimization of preventive maintenance orders scheduling as a multi-skilled resource-constrained flow shop problem

IF 1.4 Q3 OPERATIONS RESEARCH & MANAGEMENT SCIENCE
Masoud Fekri, Mehdi Heydari, Mohammad Mahdavi Mazdeh
{"title":"Two-objective optimization of preventive maintenance orders scheduling as a multi-skilled resource-constrained flow shop problem","authors":"Masoud Fekri, Mehdi Heydari, Mohammad Mahdavi Mazdeh","doi":"10.5267/j.dsl.2022.10.007","DOIUrl":null,"url":null,"abstract":"In this article, the application of the Multi-Skilled Resource-Constrained Flow Shop Scheduling Problem (MSRC-FSSP) in preventive maintenance as a case study has been investigated. In other words, to complete each maintenance order at each stage, in addition to the machine, a set of required human resources with different skills must be available. According to human resources skills, each of them can perform at least one order or at most N orders, and each maintenance order must be done by a set of human resources with different skills. To carry out a maintenance order, different human resources must be in communication and cooperation so that a preventive maintenance order can be completed. In this article, these resources are considered as technical supervisors, repairmen and maintenance managers who complete all maintenance orders in a flow shop environment as a job. For this problem, a new Mixed Integer Linear Programming (MILP) model has been formulated with the two-objective functions, minimizing total orders completion time and the human resources idle time. To solve the model on a small scale, CPLEX is used, and to solve it on a large scale, due to the fact that this problem is NP-Hard, a meta-heuristic algorithm named Genetic Algorithm (GA) is presented. Finally, the computational results have been done to validate the model, along with the analysis of the human resources idle time.","PeriodicalId":38141,"journal":{"name":"Decision Science Letters","volume":null,"pages":null},"PeriodicalIF":1.4000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Decision Science Letters","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5267/j.dsl.2022.10.007","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 1

Abstract

In this article, the application of the Multi-Skilled Resource-Constrained Flow Shop Scheduling Problem (MSRC-FSSP) in preventive maintenance as a case study has been investigated. In other words, to complete each maintenance order at each stage, in addition to the machine, a set of required human resources with different skills must be available. According to human resources skills, each of them can perform at least one order or at most N orders, and each maintenance order must be done by a set of human resources with different skills. To carry out a maintenance order, different human resources must be in communication and cooperation so that a preventive maintenance order can be completed. In this article, these resources are considered as technical supervisors, repairmen and maintenance managers who complete all maintenance orders in a flow shop environment as a job. For this problem, a new Mixed Integer Linear Programming (MILP) model has been formulated with the two-objective functions, minimizing total orders completion time and the human resources idle time. To solve the model on a small scale, CPLEX is used, and to solve it on a large scale, due to the fact that this problem is NP-Hard, a meta-heuristic algorithm named Genetic Algorithm (GA) is presented. Finally, the computational results have been done to validate the model, along with the analysis of the human resources idle time.
预防性维修订单调度的双目标优化作为多技能资源约束的流水车间问题
本文以多技能资源约束流车间调度问题(MSRC-FSSP)在预防性维修中的应用为例进行了研究。换句话说,要完成每个阶段的每个维修订单,除了机器之外,还必须有一组不同技能的所需人力资源。根据人力资源技能,每个人可以执行至少一个订单或最多N个订单,并且每个维护订单必须由一组具有不同技能的人力资源完成。为了执行维修令,不同的人力资源必须进行沟通和合作,才能完成预防性维修令。在本文中,这些资源被视为技术主管、维修人员和维护经理,他们在流程车间环境中完成所有维护命令,并将其作为一项工作。针对这一问题,提出了一种新的混合整数线性规划(MILP)模型,该模型具有最小化总订单完成时间和最小化人力资源空闲时间的双目标函数。为了在小范围内求解该模型,采用了CPLEX算法;为了在大范围内求解该模型,由于该问题属于NP-Hard问题,提出了一种元启发式算法——遗传算法(Genetic algorithm, GA)。最后对模型进行了计算验证,并对人力资源闲置时间进行了分析。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Decision Science Letters
Decision Science Letters Decision Sciences-Decision Sciences (all)
CiteScore
3.40
自引率
5.30%
发文量
49
审稿时长
20 weeks
×
引用
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学术官方微信