Replenishment Policies for Multi‐Product Stochastic Inventory Systems with Correlated Demand and Joint‐Replenishment Costs

This study analyzes optimal replenishment policies that minimize expected discounted cost of multi‐product stochastic inventory systems. The distinguishing feature of the multi‐product inventory system that we analyze is the existence of correlated demand and joint‐replenishment costs across multiple products. Our objective is to understand the structure of the optimal policy and use this structure to construct a heuristic method that can solve problems set in real‐world sizes/dimensions. Using an MDP formulation we first compute the optimal policy. The optimal policy can only be computed for problems with a small number of product types due to the curse of dimensionality. Hence, using the insight gained from the optimal policy, we propose a class of policies that captures the impact of demand correlation on the structure of the optimal policy. We call this class (s, c, d, S)‐policies, and also develop an algorithm to compute good policies in this class, for large multi‐product problems. Finally using an exhaustive set of computational examples we show that policies in this class very closely approximate the optimal policy and can outperform policies analyzed in prior literature which assume independent demand. We have also included examples that illustrate performance under the average cost objective.     

Dynamic Assignment of Flexible Service Resources

Resource flexibility is an important tool for firms to better match capacity with demand so as to increase revenues and improve service levels. However, in service contexts that require dynamically deciding whether to accept incoming jobs and what resource to assign to each accepted job, harnessing the benefits of flexibility requires using effective methods for making these operational decisions. Motivated by the resource deployment decisions facing a professional service firm in the workplace training industry, we address the dynamic job acceptance and resource assignment problem for systems with general resource flexibility structure, i.e., with multiple resource types that can each perform different overlapping subsets of job types. We first show that, for systems containing specialized resources for individual job types and a versatile resource type that can perform all job types, the exact policy uses a threshold rule. With more general flexibility structures, since the associated stochastic dynamic program is intractable, we develop and test three optimization‐based approximate policies. Our extensive computational tests show that one of the methods, which we call the Bottleneck Capacity Reservation policy, is remarkably effective in generating near‐optimal solutions over a wide range of problem scenarios. We also consider a model variant that requires dynamic job acceptance decisions but permits deferring resource assignment decisions until the end of the horizon. For this model, we discuss an adaptation of our approximate policy, establish the effectiveness of this policy, and assess the value of postponing assignment decisions.     

基于系统柔性的MTS-MTO混合生产决策

研究生产商采用MTS、MTO混合作业的方式为不同客户提供产品和服务的策略。计划利用一组可灵活控制的动态设备处理那些不同需求的MTS和MTO生产业务，为此，我们开发了一个多服务台的排队模型，利用拟生灭过程和相位型分布得到了MTS、MTO排队系统平衡条件和稳态概率矩阵几何解。通过求解分块矩阵方程组，给出了系统队列长度、平均等待队长、顾客服务水平等绩效测度指标。建立了系统运作成本最优化的数学模型，采用搜索算法，确定了关键参数的边界值，找到了混合系统运作的最优策略。数值模拟和系统绩效比较分析结果显示：（1）动态切换策略能够更快速的帮助MTS恢复目标库存量，控制系统缺货风险，降低库存持有成本；（2）找到了满足顾客服务水平的最少的设备配置数量和库存成本最低的生产切换时间，且动态系统的平均队列长度低于静态系统；（3）混合运作策略减少了约2/3的静态系统平均队列长度，企业在队列长度减小的窗口期内可以接受更多订单和缩短MTO订单交货时间。     

Improving Performance in Outpatient Appointment Services with a Simulation Optimization Approach

Outpatient health care service providers face increasing pressure to improve the quality of their service through effective scheduling of appointments. In this paper, a simulation optimization approach is used to determine optimal rules for a stochastic appointment scheduling problem. This approach allows for the consideration of more variables and factors in modeling this system than in prior studies, providing more flexibility in setting policy under various problem settings and environmental factors. Results show that the dome scheduling rule proposed in prior literature is robust, but practitioners could benefit from considering a flatter, “plateau‐dome.” The plateau–dome scheduling pattern is shown to be robust over many different performance measures and scenarios. Furthermore, because this is the first application of simulation optimization to appointment scheduling, other insights are gleaned that were not possible with prior methodologies.     

Blocking in Healthcare Operations: A New Heuristic and an Application

We consider the problem of optimal capacity allocation in a hospital setting, where patients pass through a set of units, for example intensive care and acute care (AC), or AC and post‐acute care. If the second stage is full, a patient whose service at the first stage is complete is blocked and cannot leave the first stage. We develop a new heuristic for tandem systems to efficiently evaluate the effects of such blocking on system performance and we demonstrate that this heuristic performs well when compared with exact solutions and other approaches presented in the literature. In addition, we show how our tandem heuristic can be used as a building block to model more complex multi‐stage hospital systems with arbitrary patient routing, and we derive insights and actionable capacity strategies for a real hospital system where such blocking occurs between units.     

Flexible Servers in Understaffed Tandem Lines

We study the dynamic assignment of cross‐trained servers to stations in understaffed lines with finite buffers. Our objective is to maximize the production rate. We identify optimal server assignment policies for systems with three stations, two servers, different flexibility structures, and either deterministic service times and arbitrary buffers or exponential service times and small buffers. We use these policies to develop server assignment heuristics for Markovian systems with larger buffer sizes that appear to yield near‐optimal throughput. In the deterministic setting, we prove that the best possible production rate with full server flexibility and infinite buffers can be attained with partial flexibility and zero buffers, and we identify the critical skills required to achieve this goal. We then present numerical results showing that these critical skills, employed with an effective server assignment policy, also yield near‐optimal throughput in the Markovian setting, even for small buffer sizes. Thus, our results suggest that partial flexibility is sufficient for near‐optimal performance, and that flexibility structures that are effective for deterministic and infinite‐buffered systems are also likely to perform well for finite‐buffered stochastic systems.     

面向批量订货和多需求类的生产与库存配给

针对一个面向两个需求类的生产企业,根据客户每次订货是否可分批交货,提出了当客户订货可分割和不可分割时供应商的最优生产和库存配给策略.分析表明,供应商的最优生产控制策略可用一个取决于系统状态的基准库存水平表示,最优的库存配给策略则用一个多层的取决于状态的配给水平向量表示.随后,该结论被推广至包含任意多个需求类的生产系统.数值分析验证了文中最优策略的有效性.     

On the benefits of operational flexibility in a distribution network with transshipment

We consider a centralized distribution network with multiple retailers who receive replenishment inventory to satisfy customer demand of the local markets. The operational flexibility of the network is defined as the opportunity that one retailer's excess inventory can be transferred to satisfy other retailers’ unmet customer demand due to stock-outs. A general modeling framework is developed to optimize retailers’ order quantities under any possible flexibility level of a stylized two-stage distribution network. We apply the framework to formulate and solve the transshipment problem of a distribution network with three retailers. Six typical flexibility levels are investigated to make the comparison study on the firm's profit performance under three ordering quantity policies: average demand, newsvendor order quantity, and optimal order quantity. We find that the operational flexibility and system optimization are complements to the firm's performance. The ordering policy with newsvendor ordering quantity can perform fairly well with moderate flexibility level when compared with the optimized ordering policy with full flexibility.     

Development and analysis of mathematical and simulation models of decision-making tools for remanufacturing

This article presents decision-making tools for remanufacturing. The first decision-making tool was used to address inventory lot-sizing problems in a hybrid remanufacturing–manufacturing system with varying remanufacturing fraction. In this article, the new inventory lot-sizing model with variable remanufacturing lot sizes has been shown to exhibit better performance than the benchmark model with fixed remanufacturing lot sizes. The new inventory lot-sizing model is anticipated to become a valuable decision-making tool in companies that are planning to adopt remanufacturing. The second decision-making tool was applied to address a production and inventory planning problem in a remanufacturing system considering different remanufacturing policies for a given remanufacturing strategy. For a remanufacture-to-stock system with two quality remanufacturables groups four alternative policies were examined, a policy which specifies simultaneous processing utilising dedicated resources was shown to be the best policy to achieve a shorter remanufacturing cycle time. For a remanufacture-to-order system with two quality remanufacturables groups, the three relevant policies of the four alternative policies were examined, a policy which specifies sequential processing and switching between various quality remanufacturables groups was shown to be the best policy to achieve a shorter remanufacturing cycle time. The production and inventory planning simulation models in a remanufacturing system are expected to become significant decision-making tools in remanufacturing operations.     

A coordination mechanism with fair cost allocation for divergent multi-echelon inventory systems

In this paper we study the coordination of inventory control in divergent multi-echelon inventory systems under periodic review and decentralized control. Under decentralized control the installations decide upon replenishment policies that minimize their individual inventory costs. In general these policies do not coincide with the optimal policies of the system under centralized control. Hence, the total cost under decentralized control is larger than under centralized control. We present a simple coordination mechanism that removes this cost inefficiency. The upstream installations increases its base stock level while the downstream installations compensate their supplier for increased costs and provide it with additional side payments. We show that this mechanism coordinates the system; the global optimal policy of the system is the unique Nash equilibrium of the corresponding strategic game. Furthermore, the mechanism results in a fair allocation of the costs; all installations enjoy cost savings.     

动态需求下车辆路径问题的周期性优化模型及求解

针对客户点不断更新的动态需求车辆路径问题,依据滚动时域对配送中心工作时间进行划分,提出基于延迟服务的周期性客户点实时重置策略,策略中延迟服务机制能结合车辆启动延迟系数对照当前时域的时间进行检验,满足所有客户点的服务需求,保证车辆满足中心时间窗约束。设计多阶段求解的混合变邻域人工蜂群算法对各时间片内子问题进行连续迭代优化,算法中子路径动态转变的设计能较好平衡原有客户点和新客户点对路径更新和车辆实时信息匹配的要求。算例验证及对比分析表明本文策略和算法在求解动态问题时的有效性和可行性。     

Joint production and subcontracting planning of unreliable multi-facility multi-product production systems

This article addresses the problem of joint optimization of production and subcontracting of unreliable production systems. The production system considered presents a common problem in the pharmaceutical industry. It is composed of multiple production facilities with different capacities, each of which is capable of producing two different classes of medications (brand name and generic). The resort to subcontracting is double: first, it involves the quantity of products received on a regular basis in order to compensate for insufficient production capacity in existing facilities, second, when needed, urgent orders are also launched in order to reduce the risk of shortages caused by breakdowns of manufacturing facilities. Failures, repairs and urgent delivery times may be represented by any probability distributions.The objective is to propose a general control policy for the system under consideration, and to obtain, in the case of two facilities, optimal control parameters that minimize the total incurred cost for a specific level of the customer service provided. Given the complexity of the problem considered, an experimental optimization approach is chosen in order to determine the optimal control parameters. This approach includes experimental design, analysis of variance, response surface methodology and simulation modeling. It allows the accurate representation of the dynamic and stochastic behaviors of the production system and the assessment of optimal control parameters. Other control parameters which represent the subcontracting are introduced and three joint production/subcontracting control policies (general, urgent, regular) are compared to one another. The proposed joint production/regular subcontracting control policy involves a cost decrease of up to 20%, as compared to results obtained by Dror et al. [1], who used a simplified control policy in addition to a heuristic solution approach for a real case study. This policy offers not only cost savings, but is also easier to manage, as compared to that proposed by Dror et al. [1]. Numerical examples and a sensitivity analysis are also performed to illustrate the robustness of the proposed control policy and the solution approach.     

Managing appointments with waiting time targets and random walk-ins

The random arrivals of walk-in patients significantly affect the daily operations of healthcare facilities. To improve the performance of outpatient departments, this paper attempts to make an appointment schedule by considering walk-ins and the waiting time target (WTT) for appointment patients. A stochastic programming model is proposed to solve this problem with the objective of minimizing the weighted patient waiting and makespan cost. A non-decreasing waiting cost function is used to capture the WTT fulfillment of appointment patients, whereas walk-ins incur a linear waiting cost. A finite-horizon Markov Decision Process model is formulated to establish the optimal real-time scheduling policy under a given appointment schedule. The appointment schedule is determined by a two-stage stochastic programming approximation and a local search improvement. Structural properties of the optimal appointment scheduling and real-time scheduling policies are established. In particular, it is shown that appointment overbooking is allowed only at the end of the regular session, and the optimal real-time scheduling policy is an easy-to-implement threshold policy with bounded sensitivity. Numerical experiments based on real data are performed to investigate the influence of different parameters and to compare different schedules. The optimal schedule demonstrates superior performance by allowing reasonable waiting times for appointment patients depending on their WTTs. Managerial insights are also provided to hospital managers. Finally, the basic model is extended by incorporating random service times and random arrivals of appointment patients. The latter includes the random number of patients that show up for service or call for appointments, and the random arrival time (unpunctuality). Appointment overbooking strategies are shown to have different structures under some stochastic factors.     

Quantifying the effectiveness of VMI and integrated inventory management in a supply chain with uncertain lead-times and uncertain demands

This article considers the inventory management problem in a supply chain with uncertain replenishment lead-times and uncertain demands. The optimal integrated inventory management (IIM) policy is developed using stochastic dynamic programming theory. The IIM policy is contrasted with two pull-type vendor-managed inventory policies (VMI-1 and VMI-2) and a traditional retailer-managed inventory policy (RMI). Computational results show that in such stochastic supply chains, IIM performs about 23, 15, and 3% better than the optimised RMI, VMI-1 and VMI-2 policies, respectively, while two VMI policies are about 8 and 20% better than the best RMI. The basestock-based VMI-2 is a very good form of VMI. The ANOVA analysis reveals that the replenishment lead-times have the largest effect on the relative performance between IIM and other policies. Numerical examples demonstrated that the IIM policy has good structural properties and can be characterised by a set of switching curves.     

多心理账户下的群体投资决策规则优化研究

从决策者有限理性角度,引入行为金融于群体投资决策系统,研究了多心理账户下群体投资决策规则优化问题。研究给出了群体投资决策系统诸多非标准金融实证异象行为的金融解释,并指出了决策者金字塔式心理账户结构;研究提出了各个心理账户下离散随机变量的信息度量方法,以行为证券组合理论为内核进行集成建模,揭示了多心理账户下群体投资决策规则的优化机理。     

The Time Consistency of Optimal Monetary and Fiscal Policies

We show that optimal monetary and fiscal policies are time consistent for a class of economies often used in applied work, economies appealing because they are consistent with the growth facts. We establish our results in two steps. We first show that for this class of economies, the Friedman rule of setting nominal interest rates to zero is optimal under commitment. We then show that optimal policies are time consistent if the Friedman rule is optimal. For our benchmark economy in which the time consistency problem is most severe, the converse also holds: if optimal policies are time consistent, then the Friedman rule is optimal.     

Near-optimal control policy for loss networks

In this paper, the phenomenon of the optimal management of requests of service in general networks is formulated as a control problem for a finite number of multiserver loss queues with Markovian routing. This type of problem may arise in a wide range of fields, e.g., manufacturing industries, storage facilities, computer networks, and communication systems. Using inductive approach of dynamic programming, the optimal admission control can be induced to be the functions of the number of requested service in progress. However, for large-scale network, the computational burden to find optimal control policy may be infeasible due to its involvement of the states for all stations in the networks. Hence, the idea of bottleneck modeling is borrowed to compute the near-optimal admission control policy. We reduced the scale of loss network and decreased the difference between the original and reduced models by making compensation for system parameters. A novel method is proposed in this paper to compute the compensation. Numerical results show that the near-optimal control policy demonstrates close performance to the optimal policy.     

考虑维修服务质量的产品质保联合决策

在售后服务竞争日益激烈的大环境下,维修服务质量对于企业的意义越来越重要。经典的质保决策问题通常关心质保期和产品价格的联合决策问题,本文在此基础上进一步考虑了质保维修的服务质量问题。质保期、产品价格以及维修服务质量在产品生命周期内存在动态的关联关系,目前同时考虑此三类因素的研究尚不多见。本文以具有重复购买行为的大众消费品为研究对象,构建了包括成本模型、需求模型、利润模型在内的最优控制模型,并应用最大化原理对模型进行求解分析,在此基础上进一步对最优策略在静态市场和动态市场的应用分别做了具体分析和数值试验。     

End‐of‐Life Inventory Decisions for Consumer Electronics Service Parts

We consider a consumer electronics manufacturer's problem of controlling the inventory of spare parts in the final phase of the service life cycle. The final phase starts when the part production is terminated and continues until the last service contract or warranty period expires. Placing final orders for service parts is considered to be a popular tactic to satisfy demand during this period and to mitigate the effect of part obsolescence at the end of the service life cycle. Previous research focuses on repairing defective products by replacing the defective parts with properly functioning spare ones. However, for consumer electronic products there typically is considerable price erosion while repair costs stay steady over time. As a consequence, there might be a point in time at which the unit price of the product drops below the repair costs. If so, it is more cost effective to adopt an alternative policy to meet service demands toward the end of the final phase, such as offering customers a new product of the similar type or a discount on a next generation product. This study examines the cost trade‐offs of implementing alternative policies for the repair policy and develops an exact expression for the expected total cost function. Using this expression, the optimal final order quantity and switching time from repair to an alternative policy can be determined simultaneously. Numerical analysis of a real world case sheds light on the cost benefits of these policies and also yields insights into the quantitative importance of the various cost parameters.     

THE VALUE OF SKU RATIONALIZATION IN PRACTICE (THE POOLING EFFECT UNDER SUBOPTIMAL INVENTORY POLICIES AND NONNORMAL DEMAND)

Several approaches to the widely recognized challenge of managing product variety rely on the pooling effect. Pooling can be accomplished through the reduction of the number of products or stock‐keeping units (SKUs), through postponement of differentiation, or in other ways. These approaches are well known and becoming widely applied in practice. However, theoretical analyses of the pooling effect assume an optimal inventory policy before pooling and after pooling, and, in most cases, that demand is normally distributed. In this article, we address the effect of nonoptimal inventory policies and the effect of nonnormally distributed demand on the value of pooling. First, we show that there is always a range of current inventory levels within which pooling is better and beyond which optimizing inventory policy is better. We also find that the value of pooling may be negative when the inventory policy in use is suboptimal. Second, we use extensive Monte Carlo simulation to examine the value of pooling for nonnormal demand distributions. We find that the value of pooling varies relatively little across the distributions we used, but that it varies considerably with the concentration of uncertainty. We also find that the ranges within which pooling is preferred over optimizing inventory policy generally are quite wide but vary considerably across distributions. Together, this indicates that the value of pooling under an optimal inventory policy is robust across distributions, but that its sensitivity to suboptimal policies is not. Third, we use a set of real (and highly erratic) demand data to analyze the benefits of pooling under optimal and suboptimal policies and nonnormal demand with a high number of SKUs. With our specific but highly nonnormal demand data, we find that pooling is beneficial and robust to suboptimal policies. Altogether, this study provides deeper theoretical, numerical, and empirical understanding of the value of pooling.