考虑外包选择的具有成本相关目标函数的柔性流水车间调度

Q2 Engineering
Mojtaba Enayati, E. Asadi-Gangraj, M. Paydar
{"title":"考虑外包选择的具有成本相关目标函数的柔性流水车间调度","authors":"Mojtaba Enayati, E. Asadi-Gangraj, M. Paydar","doi":"10.22094/JOIE.2020.1873983.1674","DOIUrl":null,"url":null,"abstract":"This study considers outsourcing decisions in a flexible flow shop scheduling problem, in which each job can be processed by either an in-house production line or outsourced. The selected objective function aims to minimize the weighted sum of tardiness costs, in-house production costs, and outsourcing costs with respect to the jobs due date. The purpose of the problem is to select the jobs that must be processed in-house, schedule processing of the jobs in-house, and finally select and assign other jobs to the subcontractors. We develop a mixed-integer linear programming (MILP) model for the research problem. Regarding the complexity of the research problem, the MILP model cannot be used for large-scale problems. Therefore, four metaheuristic algorithms, including SA, GA, PSO, hybrid PSO-SA, are proposed to solve the problem. Furthermore, some random test problems with different sizes are generated to evaluate the effectiveness of the proposed MILP model and solution approaches. The obtained results demonstrate that the GA can obtain better solutions in comparison to the other algorithms.","PeriodicalId":36956,"journal":{"name":"Journal of Optimization in Industrial Engineering","volume":"14 1","pages":"69-88"},"PeriodicalIF":0.0000,"publicationDate":"2021-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Scheduling on flexible flow shop with cost-related objective function considering outsourcing options\",\"authors\":\"Mojtaba Enayati, E. Asadi-Gangraj, M. Paydar\",\"doi\":\"10.22094/JOIE.2020.1873983.1674\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This study considers outsourcing decisions in a flexible flow shop scheduling problem, in which each job can be processed by either an in-house production line or outsourced. The selected objective function aims to minimize the weighted sum of tardiness costs, in-house production costs, and outsourcing costs with respect to the jobs due date. The purpose of the problem is to select the jobs that must be processed in-house, schedule processing of the jobs in-house, and finally select and assign other jobs to the subcontractors. We develop a mixed-integer linear programming (MILP) model for the research problem. Regarding the complexity of the research problem, the MILP model cannot be used for large-scale problems. Therefore, four metaheuristic algorithms, including SA, GA, PSO, hybrid PSO-SA, are proposed to solve the problem. Furthermore, some random test problems with different sizes are generated to evaluate the effectiveness of the proposed MILP model and solution approaches. The obtained results demonstrate that the GA can obtain better solutions in comparison to the other algorithms.\",\"PeriodicalId\":36956,\"journal\":{\"name\":\"Journal of Optimization in Industrial Engineering\",\"volume\":\"14 1\",\"pages\":\"69-88\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Optimization in Industrial Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.22094/JOIE.2020.1873983.1674\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"Engineering\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Optimization in Industrial Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.22094/JOIE.2020.1873983.1674","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 1

摘要

本研究考虑了柔性流水车间调度问题中的外包决策,在该问题中,每个作业都可以由内部生产线处理或外包。选定的目标函数旨在最小化与工作到期日相关的延迟成本、内部生产成本和外包成本的加权和。问题的目的是选择必须在内部处理的作业,安排在内部处理作业,并最终选择其他作业并将其分配给分包商。针对这一研究问题,我们建立了一个混合整数线性规划(MILP)模型。考虑到研究问题的复杂性,MILP模型不能用于大规模问题。为此,提出了SA、GA、PSO、混合PSO-SA四种元启发式算法来解决该问题。此外,还生成了一些不同大小的随机测试问题,以评估所提出的MILP模型和求解方法的有效性。结果表明,与其他算法相比,遗传算法可以获得更好的解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Scheduling on flexible flow shop with cost-related objective function considering outsourcing options
This study considers outsourcing decisions in a flexible flow shop scheduling problem, in which each job can be processed by either an in-house production line or outsourced. The selected objective function aims to minimize the weighted sum of tardiness costs, in-house production costs, and outsourcing costs with respect to the jobs due date. The purpose of the problem is to select the jobs that must be processed in-house, schedule processing of the jobs in-house, and finally select and assign other jobs to the subcontractors. We develop a mixed-integer linear programming (MILP) model for the research problem. Regarding the complexity of the research problem, the MILP model cannot be used for large-scale problems. Therefore, four metaheuristic algorithms, including SA, GA, PSO, hybrid PSO-SA, are proposed to solve the problem. Furthermore, some random test problems with different sizes are generated to evaluate the effectiveness of the proposed MILP model and solution approaches. The obtained results demonstrate that the GA can obtain better solutions in comparison to the other algorithms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Optimization in Industrial Engineering
Journal of Optimization in Industrial Engineering Engineering-Industrial and Manufacturing Engineering
CiteScore
2.90
自引率
0.00%
发文量
0
审稿时长
32 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学术官方微信