Strategic capacity decision‐making in a stochastic manufacturing environment using real‐time approximate dynamic programming

In this study, we illustrate a real‐time approximate dynamic programming (RTADP) method for solving multistage capacity decision problems in a stochastic manufacturing environment, by using an exemplary three‐stage manufacturing system with recycle. The system is a moderate size queuing network, which experiences stochastic variations in demand and product yield. The dynamic capacity decision problem is formulated as a Markov decision process (MDP). The proposed RTADP method starts with a set of heuristics and learns a superior quality solution by interacting with the stochastic system via simulation. The curse‐of‐dimensionality associated with DP methods is alleviated by the adoption of several notions including “evolving set of relevant states,” for which the value function table is built and updated, “adaptive action set” for keeping track of attractive action candidates, and “nonparametric k nearest neighbor averager” for value function approximation. The performance of the learned solution is evaluated against (1) an “ideal” solution derived using a mixed integer programming (MIP) formulation, which assumes full knowledge of future realized values of the stochastic variables (2) a myopic heuristic solution, and (3) a sample path based rolling horizon MIP solution. The policy learned through the RTADP method turned out to be superior to polices of 2 and 3. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 2010     

The Demand for Military Expenditure in Europe: The Role of Fiscal Space in the Context of a Resurgent Russia

A variant of established work on the demand for military expenditure is developed based on a practical concept of fiscal space from the perspective of short-term government choices concerning public expenditures. A new indicator, referred to as fiscal capacity, is defined and used as a candidate explanatory variable in an empirical model of European defence spending over the 2007–2016 period. Fiscal capacity is found to outperform simpler measurements of economic conditions, notably GDP growth forecasts, in explaining changes in defence spending efforts as a share of GDP. Regarding security environment variables, the results suggest that Russia has recently come to be seen as a potential military threat by European nations, leading to defence spending increases, the more so the shorter the distance to stationed or deployed Russian forces, and particularly so by those European nations that have a land border with Russia. A prospective exercise is then carried out in order to assess the capacity of EU member states that are also members of NATO to reach NATO’s 2% goal for defence spending over a mid-term horizon.     

A worst‐case formulation for constrained ranking and selection with input uncertainty

In this research, we consider robust simulation optimization with stochastic constraints. In particular, we focus on the ranking and selection problem in which the computing time is sufficient to evaluate all the designs (solutions) under consideration. Given a fixed simulation budget, we aim at maximizing the probability of correct selection (PCS) for the best feasible design, where the objective and constraint measures are assessed by their worst‐case performances. To simplify the complexity of PCS, we develop an approximated probability measure and derive the asymptotic optimality condition (optimality condition as the simulation budget goes to infinity) of the resulting problem. A sequential selection procedure is then designed within the optimal computing budget allocation framework. The high efficiency of the proposed procedure is tested via a number of numerical examples. In addition, we provide some useful insights into the efficiency of a budget allocation procedure.     

Excess procurement strategies by a dominant buyer under constrained supply

Supply chains are often characterized by the presence of a dominant buyer purchasing from a supplier with limited capacity. We study such a situation where a single supplier sells capacity to an established and more powerful buyer and also to a relatively less powerful buyer. The more powerful buyer enjoys the first right to book her capacity requirements at supplier's end, and then the common supplier fulfills the requirement of the less powerful buyer. We find that when the supplier's capacity is either too low (below the lower threshold) or too high (above the higher threshold), there is no excess procurement as compared to the case when supplier has infinite capacity. When the supplier's capacity is between these two thresholds, the more powerful buyer purchases an excess amount in comparison to the infinite capacity case.     

弹(箭)体级间连接结构准静载失效实验与数值预示

级间螺栓法兰连接是导弹(火箭)常见的连接方式,但破坏了整体结构连续性,且承载能力薄弱,在外荷载作用下易发生失效而使整弹(箭)结构强度丧失。根据实际导弹(火箭)连接结构特点,简化设计并制作了一组原理性实验件,设计了准静载加载实验测试系统和螺栓响应信号传感器,进行了两次准静载失效实验,并利用ABAQUS软件建立了对应的有限元仿真模型。根据实验效果和实测数据,分析了连接结构在准静载荷载作用下的失效机理,并对比验证发现有限元模型数值模拟效果和精度与实验吻合较好。研究结论可为弹(箭)体级间连接结构承载能力和失效实验设计提供参考。     

Stochastic production capacity: A bane or a boon for quick response supply chains?

The quick response (QR) system that can cope with demand volatility by shortening lead time has been well studied in the literature. Much of the existing literature assumes implicitly or explicitly that the manufacturers under QR can always meet the demand because the production capacity is always sufficient. However, when the order comes with a short lead time under QR, availability of the manufacturer's production capacity is not guaranteed. This motivates us to explore QR in supply chains with stochastic production capacity. Specifically, we study QR in a two-echelon supply chain with Bayesian demand information updating. We consider the situation where the manufacturer's production capacity under QR is uncertain. We first explore how stochastic production capacity affects supply chain decisions and QR implementation. We then incorporate the manufacturer's ability to expand capacity into the model. We explore how the manufacturer determines the optimal capacity expansion decision, and the value of such an ability to the supply chain and its agents. Finally, we extend the model to the two-stage two-ordering case and derive the optimal ordering policy by dynamic programming. We compare the single-ordering and two-ordering cases to generate additional managerial insights about how ordering flexibility affects QR when production capacity is stochastic. We also explore the transparent supply chain and find that our main results still hold.     

A general strategic capacity planning model under demand uncertainty

Capacity planning decisions affect a significant portion of future revenue. In equipment intensive industries, these decisions usually need to be made in the presence of both highly volatile demand and long capacity installation lead times. For a multiple product case, we present a continuous‐time capacity planning model that addresses problems of realistic size and complexity found in current practice. Each product requires specific operations that can be performed by one or more tool groups. We consider a number of capacity allocation policies. We allow tool retirements in addition to purchases because the stochastic demand forecast for each product can be decreasing. We present a cluster‐based heuristic algorithm that can incorporate both variance reduction techniques from the simulation literature and the principles of a generalized maximum flow algorithm from the network optimization literature. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

海区变化对新型舰船海水淡化装置性能的影响

针对舰船远航时某新型海水淡化装置性能随海水盐度等因素变化而改变的问题,分析了该型海水淡化装置主要影响因素,并对其造水量进行了热力校核计算.实例计算结果表明,某航行海区较设计海区排污系数相对增大近25倍,造水量由原来的2 042 kg/h下降到1 847 kg/h,下降了9.55%.     

数字化坦克营作战能力灰色聚类评估

评估数字化坦克营的作战能力对推动数字化装甲部队建设、提高部队战斗力具有一定的现实意义。以灰色系统理论为基础,将层次分析法和灰色评估法相结合,建立了数字化坦克营的灰色聚类评估模型,论述了利用该模型进行评估的基本步骤,结合实例对数字化坦克营作战能力进行了聚类评估,提出了提高数字化坦克营作战能力的方法。评估结果比较符合实际情况,证明了该模型的正确性。     

Complexity and workload considerations in product mix decisions under the theory of constraints

The literature on the product mix decision (or master production scheduling) under the Theory of Constraints (TOC), which was developed in the past two decades, has addressed this problem as a static operational decision. Consequently, the developed solution techniques do not consider the system's dynamism and the associated challenges arising from the complexity of operations during the implementation of master production schedules. This paper aims to address this gap by developing a new heuristic approach for master production scheduling under the TOC philosophy that considers the main operational factors that influence actual throughput after implementation of the detailed schedule. We examine the validity of the proposed heuristic by comparison to Integer Linear Programming and two heuristics in a wide range of scenarios using simulation modelling. Statistical analyses indicate that the new algorithm leads to significantly enhanced performance during implementation for problems with setup times. The findings show that the bottleneck identification approach in current methods in the TOC literature is not effective and accurate for complex operations in real‐world job shop systems. This study contributes to the literature on master production scheduling and product mix decisions by enhancing the likelihood of achieving anticipated throughput during the implementation of the detailed schedule. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 357–369, 2015