Integrated multi-plant collaborative production, inventory, and hub-spoke delivery of make-to-order products

IF 2 3区 工程技术 Q3 ENGINEERING, INDUSTRIAL
Kefei Liu, Zhibin Jiang, Liping Zhou
{"title":"Integrated multi-plant collaborative production, inventory, and hub-spoke delivery of make-to-order products","authors":"Kefei Liu, Zhibin Jiang, Liping Zhou","doi":"10.1080/24725854.2023.2272261","DOIUrl":null,"url":null,"abstract":"AbstractMotivated by make-to-order applications with committed delivery dates in a variety of industries, we investigate the integrated multi-plant collaborative production, inventory, and hub-spoke delivery problem in a complex production-distribution network. This network includes multi-location heterogeneous plants, distribution centers, and customers, for producing customized and splittable orders with one or more general-size multi-type jobs. Completed jobs are transported from plants to distribution centers, and then the orders whose all constituent jobs have arrived are delivered from distribution centers to customer sites. The objective is to make integrated scheduling decisions for production, inventory, and delivery, for minimizing total cost composed of production, transportation, tardiness, and inventory. We first formulate this problem as a mixed-integer programming model, and analyze its intractability by proving that the problem is NP-hard and no approximation algorithms exist with a constant worst-case ratio. We then reformulate this problem as a binary integer linear programming model to select a feasible schedule for each job, and propose a combined column generation and two-layer column enumeration algorithm to solve it. Through extensive numerical experiments, we demonstrate that our proposed algorithm is capable of generating optimal or near-optimal solutions expeditiously and outperforms four benchmark approaches, and gain valuable managerial insights for practitioners.Keywords: Customized and splittable ordersintegrated schedulingmulti-plant production and hub-spoke deliverymixed-integer programmingcolumn generation and column enumerationDisclaimerAs a service to authors and researchers we are providing this version of an accepted manuscript (AM). Copyediting, typesetting, and review of the resulting proofs will be undertaken on this manuscript before final publication of the Version of Record (VoR). During production and pre-press, errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal relate to these versions also. Additional informationNotes on contributorsKefei LiuKefei Liu is a Ph.D. candidate in Management Science and Engineering from Antai College of Economics & Management, Shanghai Jiao Tong University (SJTU), Shanghai, China. Her main research interests include operations management of manufacturing systems.Zhibin JiangZhibin Jiang is currently a distinguished Professor with the Antai College of Economics & Management, SJTU, Shanghai, China. He is also the Dean of the Sino-US Global Logistics Institute of SJTU. He received a Ph.D. degree in Engineering Management from the City University of Hong Kong, Hong Kong, China, in 1999. He is a fellow of the Institute of Industrial and Systems Engineers and an Associate Editor of the International Journal of Production Research. His research interests include discrete-event modeling and simulation, and operations management in manufacturing and health care systems.Liping ZhouLiping Zhou is currently an Associate Professor with the Sino-US Global Logistics Institute, Antai College of Economics & Management, SJTU, Shanghai, China. He received a Ph.D. degree in Industrial Engineering from SJTU, Shanghai, China, in 2019. His research interests include operations management of manufacturing systems.","PeriodicalId":56039,"journal":{"name":"IISE Transactions","volume":null,"pages":null},"PeriodicalIF":2.0000,"publicationDate":"2023-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IISE Transactions","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/24725854.2023.2272261","RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"ENGINEERING, INDUSTRIAL","Score":null,"Total":0}
引用次数: 0

Abstract

AbstractMotivated by make-to-order applications with committed delivery dates in a variety of industries, we investigate the integrated multi-plant collaborative production, inventory, and hub-spoke delivery problem in a complex production-distribution network. This network includes multi-location heterogeneous plants, distribution centers, and customers, for producing customized and splittable orders with one or more general-size multi-type jobs. Completed jobs are transported from plants to distribution centers, and then the orders whose all constituent jobs have arrived are delivered from distribution centers to customer sites. The objective is to make integrated scheduling decisions for production, inventory, and delivery, for minimizing total cost composed of production, transportation, tardiness, and inventory. We first formulate this problem as a mixed-integer programming model, and analyze its intractability by proving that the problem is NP-hard and no approximation algorithms exist with a constant worst-case ratio. We then reformulate this problem as a binary integer linear programming model to select a feasible schedule for each job, and propose a combined column generation and two-layer column enumeration algorithm to solve it. Through extensive numerical experiments, we demonstrate that our proposed algorithm is capable of generating optimal or near-optimal solutions expeditiously and outperforms four benchmark approaches, and gain valuable managerial insights for practitioners.Keywords: Customized and splittable ordersintegrated schedulingmulti-plant production and hub-spoke deliverymixed-integer programmingcolumn generation and column enumerationDisclaimerAs a service to authors and researchers we are providing this version of an accepted manuscript (AM). Copyediting, typesetting, and review of the resulting proofs will be undertaken on this manuscript before final publication of the Version of Record (VoR). During production and pre-press, errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal relate to these versions also. Additional informationNotes on contributorsKefei LiuKefei Liu is a Ph.D. candidate in Management Science and Engineering from Antai College of Economics & Management, Shanghai Jiao Tong University (SJTU), Shanghai, China. Her main research interests include operations management of manufacturing systems.Zhibin JiangZhibin Jiang is currently a distinguished Professor with the Antai College of Economics & Management, SJTU, Shanghai, China. He is also the Dean of the Sino-US Global Logistics Institute of SJTU. He received a Ph.D. degree in Engineering Management from the City University of Hong Kong, Hong Kong, China, in 1999. He is a fellow of the Institute of Industrial and Systems Engineers and an Associate Editor of the International Journal of Production Research. His research interests include discrete-event modeling and simulation, and operations management in manufacturing and health care systems.Liping ZhouLiping Zhou is currently an Associate Professor with the Sino-US Global Logistics Institute, Antai College of Economics & Management, SJTU, Shanghai, China. He received a Ph.D. degree in Industrial Engineering from SJTU, Shanghai, China, in 2019. His research interests include operations management of manufacturing systems.
集成多工厂协作生产、库存和按订单产品的中心辐式交付
摘要本文研究了一个复杂的生产-分销网络中集成的多工厂协作生产、库存和轮辐交货问题。该网络包括多地点异构工厂、配送中心和客户,用于生产具有一个或多个通用尺寸多类型作业的定制和可分割订单。完成的工作从工厂运送到配送中心,然后所有组成工作都已到达的订单从配送中心运送到客户现场。目标是为生产、库存和交付做出综合调度决策,以最小化由生产、运输、延误和库存组成的总成本。我们首先将该问题表述为一个混合整数规划模型,并通过证明该问题是np困难的,并且不存在具有恒定最坏情况比的近似算法来分析其难解性。然后,我们将该问题重新表述为一个二进制整数线性规划模型,为每个作业选择一个可行的调度,并提出了一种列生成和两层列枚举的组合算法来解决它。通过大量的数值实验,我们证明了我们提出的算法能够快速生成最优或接近最优的解决方案,并且优于四种基准方法,并为从业者获得有价值的管理见解。关键词:定制和可拆分订单集成调度多厂生产和中心辐式交付混合整数编程列生成和列枚举免责声明作为对作者和研究人员的服务,我们提供此版本的已接受稿件(AM)。在最终出版版本记录(VoR)之前,将对该手稿进行编辑、排版和审查。在制作和印前,可能会发现可能影响内容的错误,所有适用于期刊的法律免责声明也与这些版本有关。刘克飞,中国上海交通大学安泰经济管理学院管理科学与工程专业博士研究生。主要研究方向为制造系统的运营管理。蒋志斌,现任上海交通大学安泰经济管理学院特聘教授。他也是上海交通大学中美全球物流研究所的院长。他于1999年获得香港城市大学工程管理博士学位。他是工业和系统工程师协会的成员,也是国际生产研究杂志的副主编。他的研究兴趣包括离散事件建模和仿真,以及制造业和医疗保健系统的运营管理。周丽萍,现任上海交通大学安泰经济管理学院中美全球物流研究所副教授。2019年获上海交通大学工业工程专业博士学位。主要研究方向为制造系统的运营管理。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IISE Transactions
IISE Transactions Engineering-Industrial and Manufacturing Engineering
CiteScore
5.70
自引率
7.70%
发文量
93
期刊介绍: IISE Transactions is currently abstracted/indexed in the following services: CSA/ASCE Civil Engineering Abstracts; CSA-Computer & Information Systems Abstracts; CSA-Corrosion Abstracts; CSA-Electronics & Communications Abstracts; CSA-Engineered Materials Abstracts; CSA-Materials Research Database with METADEX; CSA-Mechanical & Transportation Engineering Abstracts; CSA-Solid State & Superconductivity Abstracts; INSPEC Information Services and Science Citation Index. Institute of Industrial and Systems Engineers and our publisher Taylor & Francis make every effort to ensure the accuracy of all the information (the "Content") contained in our publications. However, Institute of Industrial and Systems Engineers and our publisher Taylor & Francis, our agents, and our licensors make no representations or warranties whatsoever as to the accuracy, completeness, or suitability for any purpose of the Content. Any opinions and views expressed in this publication are the opinions and views of the authors, and are not the views of or endorsed by Institute of Industrial and Systems Engineers and our publisher Taylor & Francis. The accuracy of the Content should not be relied upon and should be independently verified with primary sources of information. Institute of Industrial and Systems Engineers and our publisher Taylor & Francis shall not be liable for any losses, actions, claims, proceedings, demands, costs, expenses, damages, and other liabilities whatsoever or howsoever caused arising directly or indirectly in connection with, in relation to, or arising out of the use of the Content. Terms & Conditions of access and use can be found at http://www.tandfonline.com/page/terms-and-conditions .
×
引用
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学术官方微信