具有泊松需求、销售损失、固定设置时间和固定率离散补货的经济生产

IF 4.8 3区 管理学 Q1 ENGINEERING, MANUFACTURING
Thomas Schmitt, Bruce Faaland
{"title":"具有泊松需求、销售损失、固定设置时间和固定率离散补货的经济生产","authors":"Thomas Schmitt, Bruce Faaland","doi":"10.1111/poms.14072","DOIUrl":null,"url":null,"abstract":"Abstract We address a production/inventory problem for a single product and machine where demand is Poisson distributed, and the times for unit production and setup are constant. Demand not in stock is lost. We derive a solution for a produce‐up‐to policy that minimizes average cost per‐unit‐time, including costs of setup, inventory carrying, and lost sales. The machine is stopped periodically, possibly rendered idle, set up for a fixed period, and then restarted. The average cost function, which we derive explicitly, is quasi‐convex separately in the produce‐up‐to level Q, the low‐level R that prompts a setup, and jointly in R equals Q. We start by finding the minimizing value of Q where R equals 0, and then extend the search over larger R values. The discrete search may end with R less than Q, or on the matrix diagonal where R equals Q, depending on the problem parameters. Idle time disappears in the cycle when R equals Q, and the two parameter system folds into one. This hybrid policy is novel in make‐to‐stock problems with a setup time. The number of arithmetic operations to calculate costs in the (Q,R) matrix depends on a vector search over Q. The computation of the algorithm is bounded by a quadratic function of the minimizing value of Q. The storage requirements and number of cells visited are proportional to it. This article is protected by copyright. All rights reserved","PeriodicalId":20623,"journal":{"name":"Production and Operations Management","volume":"8 1","pages":"0"},"PeriodicalIF":4.8000,"publicationDate":"2023-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Economic Production with Poisson Demand, Lost Sales, a Constant Setup Time, and Fixed‐rate Discrete Replenishment\",\"authors\":\"Thomas Schmitt, Bruce Faaland\",\"doi\":\"10.1111/poms.14072\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract We address a production/inventory problem for a single product and machine where demand is Poisson distributed, and the times for unit production and setup are constant. Demand not in stock is lost. We derive a solution for a produce‐up‐to policy that minimizes average cost per‐unit‐time, including costs of setup, inventory carrying, and lost sales. The machine is stopped periodically, possibly rendered idle, set up for a fixed period, and then restarted. The average cost function, which we derive explicitly, is quasi‐convex separately in the produce‐up‐to level Q, the low‐level R that prompts a setup, and jointly in R equals Q. We start by finding the minimizing value of Q where R equals 0, and then extend the search over larger R values. The discrete search may end with R less than Q, or on the matrix diagonal where R equals Q, depending on the problem parameters. Idle time disappears in the cycle when R equals Q, and the two parameter system folds into one. This hybrid policy is novel in make‐to‐stock problems with a setup time. The number of arithmetic operations to calculate costs in the (Q,R) matrix depends on a vector search over Q. The computation of the algorithm is bounded by a quadratic function of the minimizing value of Q. The storage requirements and number of cells visited are proportional to it. This article is protected by copyright. All rights reserved\",\"PeriodicalId\":20623,\"journal\":{\"name\":\"Production and Operations Management\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":4.8000,\"publicationDate\":\"2023-10-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Production and Operations Management\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1111/poms.14072\",\"RegionNum\":3,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"ENGINEERING, MANUFACTURING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Production and Operations Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1111/poms.14072","RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, MANUFACTURING","Score":null,"Total":0}
引用次数: 0

摘要

摘要:我们解决了单个产品和机器的生产/库存问题,其中需求是泊松分布的,单位生产和设置的时间是恒定的。没有库存的需求就失去了。我们得出了一个解决方案,为生产到政策,最大限度地减少平均成本每单位时间,包括成本设置,库存携带,和销售损失。机器定期停止,可能使其处于空闲状态,设置一段固定的时间,然后重新启动。我们明确地推导出的平均成本函数,分别在产生上至水平Q、提示设置的低水平R和R等于Q时是拟凸的。我们首先在R等于0时找到Q的最小值,然后将搜索扩展到更大的R值。离散搜索可能在R小于Q时结束,或者在R等于Q的矩阵对角线上结束,这取决于问题的参数。当R = Q时,空闲时间在周期内消失,两个参数系统合二为一。这种混合策略在制造到库存的问题上具有新颖的设置时间。计算(Q,R)矩阵成本的算术运算次数取决于对Q的向量搜索。该算法的计算由Q的最小值的二次函数限定。存储需求和访问的单元数与之成正比。这篇文章受版权保护。版权所有
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Economic Production with Poisson Demand, Lost Sales, a Constant Setup Time, and Fixed‐rate Discrete Replenishment
Abstract We address a production/inventory problem for a single product and machine where demand is Poisson distributed, and the times for unit production and setup are constant. Demand not in stock is lost. We derive a solution for a produce‐up‐to policy that minimizes average cost per‐unit‐time, including costs of setup, inventory carrying, and lost sales. The machine is stopped periodically, possibly rendered idle, set up for a fixed period, and then restarted. The average cost function, which we derive explicitly, is quasi‐convex separately in the produce‐up‐to level Q, the low‐level R that prompts a setup, and jointly in R equals Q. We start by finding the minimizing value of Q where R equals 0, and then extend the search over larger R values. The discrete search may end with R less than Q, or on the matrix diagonal where R equals Q, depending on the problem parameters. Idle time disappears in the cycle when R equals Q, and the two parameter system folds into one. This hybrid policy is novel in make‐to‐stock problems with a setup time. The number of arithmetic operations to calculate costs in the (Q,R) matrix depends on a vector search over Q. The computation of the algorithm is bounded by a quadratic function of the minimizing value of Q. The storage requirements and number of cells visited are proportional to it. This article is protected by copyright. All rights reserved
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Production and Operations Management
Production and Operations Management 管理科学-工程:制造
CiteScore
7.50
自引率
16.00%
发文量
278
审稿时长
24 months
期刊介绍: The mission of Production and Operations Management is to serve as the flagship research journal in operations management in manufacturing and services. The journal publishes scientific research into the problems, interest, and concerns of managers who manage product and process design, operations, and supply chains. It covers all topics in product and process design, operations, and supply chain management and welcomes papers using any research paradigm.
×
引用
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学术官方微信