Pub Date : 2024-11-01DOI: 10.1016/j.orl.2024.107206
Muhammad El-Taha
We address the issue of Bernoulli/Geometric arrivals see time-averages, BASTA, in discrete-time queues when using a variety of scheduling rules. It is well-known that BASTA/ASTA holds in the framework of a discrete-time process with an imbedded arrival process without regard to scheduling rules. However, when scheduling rules are invoked, it is not always clear whether arrivals see time averages as asserted by the general theory. We resolve this issue so that BASTA/ASTA holds regardless of the scheduling rule at play.
{"title":"On BASTA for discrete-time queues","authors":"Muhammad El-Taha","doi":"10.1016/j.orl.2024.107206","DOIUrl":"10.1016/j.orl.2024.107206","url":null,"abstract":"<div><div>We address the issue of Bernoulli/Geometric arrivals see time-averages, <em>BASTA</em>, in discrete-time queues when using a variety of scheduling rules. It is well-known that <em>BASTA</em>/<em>ASTA</em> holds in the framework of a discrete-time process with an imbedded arrival process without regard to scheduling rules. However, when scheduling rules are invoked, it is not always clear whether arrivals see time averages as asserted by the general theory. We resolve this issue so that <em>BASTA</em>/<em>ASTA</em> holds regardless of the scheduling rule at play.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"57 ","pages":"Article 107206"},"PeriodicalIF":0.8,"publicationDate":"2024-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142654409","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-11-01DOI: 10.1016/j.orl.2024.107205
Royi Jacobovic , Nikki Levering
Consider a LCFS-PR queue and assume that at time , there are customers who arrived in that order. In addition, at time there is an additional customer c with service requirement who makes an admission request. At time , the system's manager should decide whether to let c join the system or not. To this end, the manager wants to evaluate the externalities generated by c, i.e., the additional waiting time that will suffer as a consequence of the admission of c. We assume that at the decision epoch the manager knows only n, x, the remaining service time of (who was getting service just before c had made his admission request) and the total workload at . In a previous work by Jacobovic, Levering and Boxma (2023), it was shown that the manager can compute the expected externalities (i.e., the natural predictor for the externalities value) but not their variance (i.e., the conventional measure of the predictor's accuracy). Motivated by this problem, in the current work, we study a convex piecewise-linear program which yields the spectrum of variance values which are consistent with the manager's information.
考虑一个 LCFS-PR M/G/1 队列，假设在时间 t=0 时，有 n+1 个客户 c1、c2、......、cn+1 依次到达。此外，在时间 t=0 时，又有一位顾客 c 提出了入场请求，其服务要求为 x>0。在时间 t=0 时，系统管理员应决定是否让 c 加入系统。为此，系统管理员需要评估 c 产生的外部效应，即我们假设在决策时间，管理者只知道 n、x、cn+1 的剩余服务时间（在 c 提出加入请求之前，cn+1 正在接受服务）以及 t=0 时的总工作量、即外部性值的自然预测值），但却无法计算其方差（即预测器准确性的传统衡量标准）。受这一问题的启发，在当前的工作中，我们研究了一个凸片段线性程序，它能得到与管理者信息一致的方差值谱。
{"title":"Assessing the accuracy of externalities prediction in a LCFS-PR M/G/1 queue under partial information","authors":"Royi Jacobovic , Nikki Levering","doi":"10.1016/j.orl.2024.107205","DOIUrl":"10.1016/j.orl.2024.107205","url":null,"abstract":"<div><div>Consider a LCFS-PR <span><math><mi>M</mi><mo>/</mo><mi>G</mi><mo>/</mo><mn>1</mn></math></span> queue and assume that at time <span><math><mi>t</mi><mo>=</mo><mn>0</mn></math></span>, there are <span><math><mi>n</mi><mo>+</mo><mn>1</mn></math></span> customers <span><math><msub><mrow><mi>c</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>c</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>,</mo><mo>.</mo><mo>.</mo><mo>.</mo><mo>,</mo><msub><mrow><mi>c</mi></mrow><mrow><mi>n</mi><mo>+</mo><mn>1</mn></mrow></msub></math></span> who arrived in that order. In addition, at time <span><math><mi>t</mi><mo>=</mo><mn>0</mn></math></span> there is an additional customer <em>c</em> with service requirement <span><math><mi>x</mi><mo>></mo><mn>0</mn></math></span> who makes an admission request. At time <span><math><mi>t</mi><mo>=</mo><mn>0</mn></math></span>, the system's manager should decide whether to let <em>c</em> join the system or not. To this end, the manager wants to evaluate the externalities generated by <em>c</em>, i.e., the additional waiting time that <span><math><msub><mrow><mi>c</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>c</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>,</mo><mo>…</mo><mo>,</mo><msub><mrow><mi>c</mi></mrow><mrow><mi>n</mi><mo>+</mo><mn>1</mn></mrow></msub></math></span> will suffer as a consequence of the admission of <em>c</em>. We assume that at the decision epoch the manager knows only <em>n</em>, <em>x</em>, the remaining service time of <span><math><msub><mrow><mi>c</mi></mrow><mrow><mi>n</mi><mo>+</mo><mn>1</mn></mrow></msub></math></span> (who was getting service just before <em>c</em> had made his admission request) and the total workload at <span><math><mi>t</mi><mo>=</mo><mn>0</mn></math></span>. In a previous work by Jacobovic, Levering and Boxma (2023), it was shown that the manager can compute the expected externalities (i.e., the natural predictor for the externalities value) but not their variance (i.e., the conventional measure of the predictor's accuracy). Motivated by this problem, in the current work, we study a convex piecewise-linear program which yields the spectrum of variance values which are consistent with the manager's information.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"57 ","pages":"Article 107205"},"PeriodicalIF":0.8,"publicationDate":"2024-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142654410","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-11-01DOI: 10.1016/j.orl.2024.107204
Jinye Du , Moris S. Strub
We study classical and monotone mean-variance portfolio selection when asset prices are continuous under general trading constraints. Our main result is that optimal values and strategies for both objectives coincide in this setting. The only assumptions required are that asset prices are continuous and that not investing in the risky assets is an admissible strategy. We in particular do not assume existence of an optimal strategy.
{"title":"Optimal strategies and values for monotone and classical mean-variance preferences coincide when asset prices are continuous","authors":"Jinye Du , Moris S. Strub","doi":"10.1016/j.orl.2024.107204","DOIUrl":"10.1016/j.orl.2024.107204","url":null,"abstract":"<div><div>We study classical and monotone mean-variance portfolio selection when asset prices are continuous under general trading constraints. Our main result is that optimal values and strategies for both objectives coincide in this setting. The only assumptions required are that asset prices are continuous and that not investing in the risky assets is an admissible strategy. We in particular do not assume existence of an optimal strategy.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"57 ","pages":"Article 107204"},"PeriodicalIF":0.8,"publicationDate":"2024-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142654411","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-11-01DOI: 10.1016/j.orl.2024.107203
Onno Boxma
We consider the number of overlapping customers in several single- and multiserver queues, i.e., the number of customers whose visit to a service system at some point in time has an overlap with that of a tagged customer. Restricting ourself to the FCFS policy, we obtain the probability generating function and moments of the number of overlaps in the , , and queue and (as an approximation) the queue.
{"title":"The number of overlapping customers","authors":"Onno Boxma","doi":"10.1016/j.orl.2024.107203","DOIUrl":"10.1016/j.orl.2024.107203","url":null,"abstract":"<div><div>We consider the number of overlapping customers in several single- and multiserver queues, i.e., the number of customers whose visit to a service system at some point in time has an overlap with that of a tagged customer. Restricting ourself to the FCFS policy, we obtain the probability generating function and moments of the number of overlaps in the <span><math><mi>M</mi><mo>/</mo><mi>G</mi><mo>/</mo><mn>1</mn></math></span>, <span><math><mi>M</mi><mo>/</mo><mi>G</mi><mo>/</mo><mn>1</mn><mo>/</mo><mi>N</mi></math></span>, <span><math><mi>M</mi><mo>/</mo><mi>M</mi><mo>/</mo><mi>c</mi></math></span> and <span><math><mi>G</mi><mo>/</mo><mi>M</mi><mo>/</mo><mi>c</mi></math></span> queue and (as an approximation) the <span><math><mi>M</mi><mo>/</mo><mi>G</mi><mo>/</mo><mi>c</mi></math></span> queue.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"57 ","pages":"Article 107203"},"PeriodicalIF":0.8,"publicationDate":"2024-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142654412","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-11-01DOI: 10.1016/j.orl.2024.107201
Pascale Bendotti , Luca Brunod Indrigo , Philippe Chrétienne , Bruno Escoffier
A set of jobs with precedence constraints is given along with a baseline schedule, resulting from the first-stage decision of a robust two-stage scheduling problem. Non-availability periods caused by unpredicted disruptions prevent jobs from being executed on certain time intervals, thus requiring rescheduling. The anchored rescheduling problem with non-availability periods is to find a schedule maximizing the number of so-called anchored jobs whose starting times remain close to the baseline schedule. It is shown to be solvable in polynomial time.
{"title":"Anchored rescheduling problem with non-availability periods","authors":"Pascale Bendotti , Luca Brunod Indrigo , Philippe Chrétienne , Bruno Escoffier","doi":"10.1016/j.orl.2024.107201","DOIUrl":"10.1016/j.orl.2024.107201","url":null,"abstract":"<div><div>A set of jobs with precedence constraints is given along with a baseline schedule, resulting from the first-stage decision of a robust two-stage scheduling problem. Non-availability periods caused by unpredicted disruptions prevent jobs from being executed on certain time intervals, thus requiring rescheduling. The anchored rescheduling problem with non-availability periods is to find a schedule maximizing the number of so-called anchored jobs whose starting times remain close to the baseline schedule. It is shown to be solvable in polynomial time.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"57 ","pages":"Article 107201"},"PeriodicalIF":0.8,"publicationDate":"2024-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142586699","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-11-01DOI: 10.1016/j.orl.2024.107200
Fei Xue, Hajunfu Ma, Maiko Shigeno
In sports scheduling, particularly for round-robin tournaments, an important objective is to create equitable game schedules. Our focus is on developing schedules that balance the number of home and away games to ensure fairness, while also maximizing the number of consecutive home games and consecutive away games, referred to as breaks. This paper establishes upper bounds for the number of breaks and demonstrates that these bounds are tight for up to 36 teams.
{"title":"Break maximization for round-robin tournaments without consecutive breaks","authors":"Fei Xue, Hajunfu Ma, Maiko Shigeno","doi":"10.1016/j.orl.2024.107200","DOIUrl":"10.1016/j.orl.2024.107200","url":null,"abstract":"<div><div>In sports scheduling, particularly for round-robin tournaments, an important objective is to create equitable game schedules. Our focus is on developing schedules that balance the number of home and away games to ensure fairness, while also maximizing the number of consecutive home games and consecutive away games, referred to as breaks. This paper establishes upper bounds for the number of breaks and demonstrates that these bounds are tight for up to 36 teams.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"57 ","pages":"Article 107200"},"PeriodicalIF":0.8,"publicationDate":"2024-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142560792","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-10-16DOI: 10.1016/j.orl.2024.107197
Aida Khajavirad
We consider the problem of packing a given number of congruent circles with the maximum radius in a unit square as a mathematical optimization problem. Due to the presence of non-overlapping constraints, this problem is a notoriously difficult nonconvex quadratically constrained optimization problem, which possesses many local optima. We consider several popular convexification techniques, giving rise to linear programming relaxations and semidefinite programming relaxations for the circle packing problem. We compare the strength of these relaxations theoretically, thereby proving the conjectures by Anstreicher. Our results serve as a theoretical justification for the ineffectiveness of existing machinery for convexification of non-overlapping constraints.
{"title":"The circle packing problem: A theoretical comparison of various convexification techniques","authors":"Aida Khajavirad","doi":"10.1016/j.orl.2024.107197","DOIUrl":"10.1016/j.orl.2024.107197","url":null,"abstract":"<div><div>We consider the problem of packing a given number of congruent circles with the maximum radius in a unit square as a mathematical optimization problem. Due to the presence of non-overlapping constraints, this problem is a notoriously difficult nonconvex quadratically constrained optimization problem, which possesses many local optima. We consider several popular convexification techniques, giving rise to linear programming relaxations and semidefinite programming relaxations for the circle packing problem. We compare the strength of these relaxations theoretically, thereby proving the conjectures by Anstreicher. Our results serve as a theoretical justification for the ineffectiveness of existing machinery for convexification of non-overlapping constraints.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"57 ","pages":"Article 107197"},"PeriodicalIF":0.8,"publicationDate":"2024-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142534930","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-10-15DOI: 10.1016/j.orl.2024.107194
Matteo Cacciola , Antonio Frangioni , Andrea Lodi
In recent years, the integration of Machine Learning (ML) models with Operation Research (OR) tools has gained popularity in applications such as cancer treatment, algorithmic configuration, and chemical process optimization. This integration often uses Mixed Integer Programming (MIP) formulations to represent the chosen ML model, that is often an Artificial Neural Networks (ANNs) due to their widespread use. However, ANNs frequently contain a large number of parameters, resulting in MIP formulations impractical to solve. In this paper we showcase the effectiveness of a ANN pruning, when applied to models prior to their integration into MIPs. We discuss why pruning is more suitable in this context than other ML compression techniques, and we highlight the potential of appropriate pruning strategies via experiments on MIPs used to construct adversarial examples to ANNs. Our results demonstrate that pruning offers remarkable reductions in solution times without hindering the quality of the final decision, enabling the resolution of previously unsolvable instances.
近年来，机器学习（ML）模型与运筹学（OR）工具的整合在癌症治疗、算法配置和化学过程优化等应用中越来越受欢迎。这种整合通常使用混合整数编程（MIP）公式来表示所选的 ML 模型，由于人工神经网络（ANN）的广泛使用，这种模型通常是人工神经网络。然而，ANN 经常包含大量参数，导致 MIP 公式难以解决。在本文中，我们展示了在将模型集成到 MIPs 之前对其进行剪枝处理的有效性。我们讨论了为什么剪枝在这种情况下比其他 ML 压缩技术更合适，并通过对用于为 ANN 构建对抗示例的 MIP 进行实验，强调了适当剪枝策略的潜力。我们的结果表明，剪枝能显著缩短求解时间，同时不影响最终决策的质量，从而解决以前无法求解的实例。
{"title":"Structured pruning of neural networks for constraints learning","authors":"Matteo Cacciola , Antonio Frangioni , Andrea Lodi","doi":"10.1016/j.orl.2024.107194","DOIUrl":"10.1016/j.orl.2024.107194","url":null,"abstract":"<div><div>In recent years, the integration of Machine Learning (ML) models with Operation Research (OR) tools has gained popularity in applications such as cancer treatment, algorithmic configuration, and chemical process optimization. This integration often uses Mixed Integer Programming (MIP) formulations to represent the chosen ML model, that is often an Artificial Neural Networks (ANNs) due to their widespread use. However, ANNs frequently contain a large number of parameters, resulting in MIP formulations impractical to solve. In this paper we showcase the effectiveness of a ANN pruning, when applied to models prior to their integration into MIPs. We discuss why pruning is more suitable in this context than other ML compression techniques, and we highlight the potential of appropriate pruning strategies via experiments on MIPs used to construct adversarial examples to ANNs. Our results demonstrate that pruning offers remarkable reductions in solution times without hindering the quality of the final decision, enabling the resolution of previously unsolvable instances.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"57 ","pages":"Article 107194"},"PeriodicalIF":0.8,"publicationDate":"2024-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142441127","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-10-15DOI: 10.1016/j.orl.2024.107199
Oliver Hinder
We analyze restarted PDHG on totally unimodular linear programs. In particular, we show that restarted PDHG finds an ϵ-optimal solution in matrix-vector multiplies where is the number of constraints, the number of variables, is the number of nonzeros in the constraint matrix, H is the largest absolute coefficient in the right hand side or objective vector, and ϵ is the distance to optimality of the outputted solution.
{"title":"Worst-case analysis of restarted primal-dual hybrid gradient on totally unimodular linear programs","authors":"Oliver Hinder","doi":"10.1016/j.orl.2024.107199","DOIUrl":"10.1016/j.orl.2024.107199","url":null,"abstract":"<div><div>We analyze restarted PDHG on totally unimodular linear programs. In particular, we show that restarted PDHG finds an <em>ϵ</em>-optimal solution in <span><math><mi>O</mi><mo>(</mo><mi>H</mi><msubsup><mrow><mi>m</mi></mrow><mrow><mn>1</mn></mrow><mrow><mn>2.5</mn></mrow></msubsup><msqrt><mrow><mtext>nnz</mtext><mo>(</mo><mi>A</mi><mo>)</mo></mrow></msqrt><mi>log</mi><mo></mo><mo>(</mo><mi>H</mi><msub><mrow><mi>m</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>/</mo><mi>ϵ</mi><mo>)</mo><mo>)</mo></math></span> matrix-vector multiplies where <span><math><msub><mrow><mi>m</mi></mrow><mrow><mn>1</mn></mrow></msub></math></span> is the number of constraints, <span><math><msub><mrow><mi>m</mi></mrow><mrow><mn>2</mn></mrow></msub></math></span> the number of variables, <span><math><mtext>nnz</mtext><mo>(</mo><mi>A</mi><mo>)</mo></math></span> is the number of nonzeros in the constraint matrix, <em>H</em> is the largest absolute coefficient in the right hand side or objective vector, and <em>ϵ</em> is the distance to optimality of the outputted solution.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"57 ","pages":"Article 107199"},"PeriodicalIF":0.8,"publicationDate":"2024-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142441128","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We consider the lost-sales inventory systems with stochastic lead times and establish the asymptotic optimality of base-stock policies for such systems. Specifically, we prove that as the per-unit lost-sales penalty cost becomes large compared to the per-unit holding cost, the ratio of the optimal base-stock policy's cost to the optimal cost converges to one. Our paper provides a theoretical guarantee of the widely adopted base-stock policies in lost-sales inventory systems with stochastic lead times for the first time.
{"title":"Asymptotic optimality of base-stock policies for lost-sales inventory systems with stochastic lead times","authors":"Shilin Yuan , Jiameng Lyu , Jinxing Xie , Yuan Zhou","doi":"10.1016/j.orl.2024.107196","DOIUrl":"10.1016/j.orl.2024.107196","url":null,"abstract":"<div><div>We consider the lost-sales inventory systems with stochastic lead times and establish the asymptotic optimality of base-stock policies for such systems. Specifically, we prove that as the per-unit lost-sales penalty cost becomes large compared to the per-unit holding cost, the ratio of the optimal base-stock policy's cost to the optimal cost converges to one. Our paper provides a theoretical guarantee of the widely adopted base-stock policies in lost-sales inventory systems with stochastic lead times for the first time.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"57 ","pages":"Article 107196"},"PeriodicalIF":0.8,"publicationDate":"2024-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142437979","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
扫码关注我们
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号