Optimization of Inventory and Capacity in Large-Scale Assembly Systems Using Extreme-Value Theory

Q1 Mathematics
M. Meijer, Dennis Schol, Willem van Jaarsveld, M. Vlasiou, Bert Zwart
{"title":"Optimization of Inventory and Capacity in Large-Scale Assembly Systems Using Extreme-Value Theory","authors":"M. Meijer, Dennis Schol, Willem van Jaarsveld, M. Vlasiou, Bert Zwart","doi":"10.1287/stsy.2022.0014","DOIUrl":null,"url":null,"abstract":"High-tech systems are typically produced in two stages: (1) production of components using specialized equipment and staff and (2) system assembly/integration. Component production capacity is subject to fluctuations, causing a high risk of shortages of at least one component, which results in costly delays. Companies hedge this risk by strategic investments in excess production capacity and in buffer inventories of components. To optimize these, it is crucial to characterize the relation between component shortage risk and capacity and inventory investments. We suppose that component production capacity and produce demand are normally distributed over finite time intervals, and we accordingly model the production system as a symmetric fork-join queueing network with N statistically identical queues with a common arrival process and independent service processes. Assuming a symmetric cost structure, we subsequently apply extreme value theory to gain analytic insights into this optimization problem. We derive several new results for this queueing network, notably that the scaled maximum of N steady-state queue lengths converges in distribution to a Gaussian random variable. These results translate into asymptotically optimal methods to dimension the system. Tests on a range of problems reveal that these methods typically work well for systems of moderate size. Funding: This work is part of the research program Complexity in High-Tech Manufacturing, (partly) financed by the Dutch Research Council (NWO) [Grant 438.16.121]. The research is also supported by the NWO programs MEERVOUD to M. Vlasiou [Grant 632.003.002] and Talent VICI to B. Zwart [Grant 639.033.413].","PeriodicalId":36337,"journal":{"name":"Stochastic Systems","volume":"119 23","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Stochastic Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1287/stsy.2022.0014","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 0

Abstract

High-tech systems are typically produced in two stages: (1) production of components using specialized equipment and staff and (2) system assembly/integration. Component production capacity is subject to fluctuations, causing a high risk of shortages of at least one component, which results in costly delays. Companies hedge this risk by strategic investments in excess production capacity and in buffer inventories of components. To optimize these, it is crucial to characterize the relation between component shortage risk and capacity and inventory investments. We suppose that component production capacity and produce demand are normally distributed over finite time intervals, and we accordingly model the production system as a symmetric fork-join queueing network with N statistically identical queues with a common arrival process and independent service processes. Assuming a symmetric cost structure, we subsequently apply extreme value theory to gain analytic insights into this optimization problem. We derive several new results for this queueing network, notably that the scaled maximum of N steady-state queue lengths converges in distribution to a Gaussian random variable. These results translate into asymptotically optimal methods to dimension the system. Tests on a range of problems reveal that these methods typically work well for systems of moderate size. Funding: This work is part of the research program Complexity in High-Tech Manufacturing, (partly) financed by the Dutch Research Council (NWO) [Grant 438.16.121]. The research is also supported by the NWO programs MEERVOUD to M. Vlasiou [Grant 632.003.002] and Talent VICI to B. Zwart [Grant 639.033.413].
利用极值理论优化大规模装配系统中的库存和产能
高科技系统的生产通常分为两个阶段:(1) 使用专业设备和人员生产组件;(2) 系统组装/集成。元件生产能力会出现波动,造成至少一种元件短缺的高风险,从而导致代价高昂的延误。公司通过对过剩生产能力和元件缓冲库存进行战略投资来规避这一风险。要优化这些投资,关键是要确定零部件短缺风险与产能和库存投资之间的关系。我们假设零部件生产能力和生产需求在有限的时间间隔内呈正态分布,并相应地将生产系统建模为一个对称的叉接排队网络,其中有 N 个统计上相同的队列,它们具有共同的到达过程和独立的服务过程。假定成本结构是对称的,我们随后将应用极值理论来分析这一优化问题。我们得出了该排队网络的几个新结果,特别是 N 个稳态队列长度的缩放最大值在分布上收敛于高斯随机变量。这些结果转化成了系统维度的渐近最优方法。对一系列问题的测试表明,这些方法通常对中等规模的系统效果良好。资助:本研究是高科技制造中的复杂性研究项目的一部分,由荷兰研究理事会(NWO)[438.16.121 号拨款](部分)资助。M. Vlasiou 的 MEERVOUD 项目 [632.003.002 号资助] 和 B. Zwart 的 Talent VICI 项目 [639.033.413 号资助] 也为本研究提供了支持。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Stochastic Systems
Stochastic Systems Decision Sciences-Statistics, Probability and Uncertainty
CiteScore
3.70
自引率
0.00%
发文量
18
×
引用
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学术官方微信