三机流程车间调度与外包交货时间

IF 4.1 2区 工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Eun-Seok Kim , Kangbae Lee , Ik Sun Lee
{"title":"三机流程车间调度与外包交货时间","authors":"Eun-Seok Kim ,&nbsp;Kangbae Lee ,&nbsp;Ik Sun Lee","doi":"10.1016/j.cor.2025.107192","DOIUrl":null,"url":null,"abstract":"<div><div>This paper addresses a scheduling issue in a three-machine flowshop with incorporating the outsourcing lead-time. In this problem, the first and second operations of jobs can either be handled in-house or outsourced to subcontractors, whereas the third operation must be processed in-house. Outsourcing a job not only incurs costs depending on each operation but also introduces a lead-time for the outsourced operation, meaning that the subsequent operation can only commence after this lead-time has elapsed. The goal of this paper is to minimize the weighted sum of both outsourcing and scheduling costs, which may be defined as either makespan or total completion time. The study explores the properties of the optimal solution and introduces two approaches: the Biased Random-Key Genetic Algorithm and the Branch-and-Bound algorithm. Computational experiments demonstrate that the proposed algorithms yield efficient and effective solutions.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"183 ","pages":"Article 107192"},"PeriodicalIF":4.1000,"publicationDate":"2025-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Three-machine flowshop scheduling with outsourcing lead-time\",\"authors\":\"Eun-Seok Kim ,&nbsp;Kangbae Lee ,&nbsp;Ik Sun Lee\",\"doi\":\"10.1016/j.cor.2025.107192\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>This paper addresses a scheduling issue in a three-machine flowshop with incorporating the outsourcing lead-time. In this problem, the first and second operations of jobs can either be handled in-house or outsourced to subcontractors, whereas the third operation must be processed in-house. Outsourcing a job not only incurs costs depending on each operation but also introduces a lead-time for the outsourced operation, meaning that the subsequent operation can only commence after this lead-time has elapsed. The goal of this paper is to minimize the weighted sum of both outsourcing and scheduling costs, which may be defined as either makespan or total completion time. The study explores the properties of the optimal solution and introduces two approaches: the Biased Random-Key Genetic Algorithm and the Branch-and-Bound algorithm. Computational experiments demonstrate that the proposed algorithms yield efficient and effective solutions.</div></div>\",\"PeriodicalId\":10542,\"journal\":{\"name\":\"Computers & Operations Research\",\"volume\":\"183 \",\"pages\":\"Article 107192\"},\"PeriodicalIF\":4.1000,\"publicationDate\":\"2025-06-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computers & Operations Research\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0305054825002205\",\"RegionNum\":2,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Operations Research","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0305054825002205","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

摘要

本文讨论了包含外包交货时间的三机流程车间的调度问题。在这个问题中,作业的第一个和第二个操作可以在内部处理,也可以外包给分包商,而第三个操作必须在内部处理。外包工作不仅会根据每个操作产生成本,而且还会引入外包操作的前置时间,这意味着后续操作只能在该前置时间过去后开始。本文的目标是最小化外包和调度成本的加权总和,这可以定义为完工时间或总完成时间。研究了最优解的性质,并介绍了两种方法:有偏随机密钥遗传算法和分支定界算法。计算实验表明,所提出的算法能产生高效的解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Three-machine flowshop scheduling with outsourcing lead-time
This paper addresses a scheduling issue in a three-machine flowshop with incorporating the outsourcing lead-time. In this problem, the first and second operations of jobs can either be handled in-house or outsourced to subcontractors, whereas the third operation must be processed in-house. Outsourcing a job not only incurs costs depending on each operation but also introduces a lead-time for the outsourced operation, meaning that the subsequent operation can only commence after this lead-time has elapsed. The goal of this paper is to minimize the weighted sum of both outsourcing and scheduling costs, which may be defined as either makespan or total completion time. The study explores the properties of the optimal solution and introduces two approaches: the Biased Random-Key Genetic Algorithm and the Branch-and-Bound algorithm. Computational experiments demonstrate that the proposed algorithms yield efficient and effective solutions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Computers & Operations Research
Computers & Operations Research 工程技术-工程:工业
CiteScore
8.60
自引率
8.70%
发文量
292
审稿时长
8.5 months
期刊介绍: Operations research and computers meet in a large number of scientific fields, many of which are of vital current concern to our troubled society. These include, among others, ecology, transportation, safety, reliability, urban planning, economics, inventory control, investment strategy and logistics (including reverse logistics). Computers & Operations Research provides an international forum for the application of computers and operations research techniques to problems in these and related fields.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信