Integrated capacity,demand, and production planning with subcontracting and overtime options

Models for integrated production and demand planning decisions can serve to improve a producer's ability to effectively match demand requirements with production capabilities. In contexts with price‐sensitive demands, economies of scale in production, and multiple capacity options, such integrated planning problems can quickly become complex. To address these complexities, this paper provides profit‐maximizing production planning models for determining optimal demand and internal production capacity levels under price‐sensitive deterministic demands, with subcontracting and overtime options. The models determine a producer's optimal price, production, inventory, subcontracting, overtime, and internal capacity levels, while accounting for production economies of scale and capacity costs through concave cost functions. We use polyhedral properties and dynamic programming techniques to provide polynomial‐time solution approaches for obtaining an optimal solution for this class of problems when the internal capacity level is time‐invariant. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Analysis of practical policies for a single link distribution system

In this paper we consider a transportation problem where several products have to be shipped from an origin to a destination by means of vehicles with given capacity. Each product is made available at the origin and consumed at the destination at the same constant rate. The time between consecutive shipments must be greater than a given minimum time. All demand needs to be satisfied on time and backlogging is not allowed. The problem is to decide when to make the shipments and how to load the vehicles with the objective of minimizing the long run average of the transportation and the inventory costs at the origin and at the destination over an infinite horizon. We consider two classes of practical shipping policies, the zero inventory ordering (ZIO) policies and the frequency‐based periodic shipping (FBPS) policies. We show that, in the worst‐case, the Best ZIO policy has a performance ratio of . A better performance guarantee of is shown for the best possible FBPS policy. The performance guarantees are tight. Finally, combining the Best ZIO and the Best FBPS policies, a policy that guarantees a performance is obtained. Computational results show that this policy gives an average percent optimality gap on all the tested instances of <1%. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Designing safety space in a supply chain to handle system‐wide disruptions

In some supply chains serious disruptions are system wide. This happens during periods of severe weather, as when storms cause shuttle tankers serving oil platforms in the North Sea to stop movements of crude oil, barges are frozen in the Mississippi, or all airplanes are grounded after a blizzard. Other notable instances of system‐wide disruption happened after the attack on the World Trade Center when all aircraft were grounded and the natural gas and crude‐oil pipelines were tangled by hurricanes in 2005. We model a situation where shutting down supply facilities is very difficult and expensive because of excessive inventory buildup from an inability to move out the production. We present a planning model that balances the cost of spare capacity versus shutting down production when planning for disruptions. The model uses an assignment model embedded in a simulation. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

An economic lot‐sizing problem with perishable inventory and economies of scale costs: Approximation solutions and worst case analysis

The costs of many economic activities such as production, purchasing, distribution, and inventory exhibit economies of scale under which the average unit cost decreases as the total volume of the activity increases. In this paper, we consider an economic lot‐sizing problem with general economies of scale cost functions. Our model is applicable to both nonperishable and perishable products. For perishable products, the deterioration rate and inventory carrying cost in each period depend on the age of the inventory. Realizing that the problem is NP‐hard, we analyze the effectiveness of easily implementable policies. We show that the cost of the best Consecutive‐Cover‐Ordering (CCO) policy, which can be found in polynomial time, is guaranteed to be no more than (4 + 5)/7 ≈ 1.52 times the optimal cost. In addition, if the ordering cost function does not change from period to period, the cost of the best CCO policy is no more than 1.5 times the optimal cost. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

教材印量决策模型研究

根据院校教材的需求特点及自印教材的费用发生特点,研究提出了３种适合于院校自印教材印量决策的随机库存模型．所提出的模型实用性强,对节省院校教材保障经费将起到直接的作用．     

备件库存限量分析及决策模型

分析了备件库存管理所对应的库存控制策略及其有关的因素,以费用为目标函数、不缺备件概率为约束条件,运用概率论及库存论原理建立了备件库存限量的决策摸型。     

The US NATO and military burden sharing: post-Cold War accomplishments and future prospects

NATO burden sharing has become an especially timely issue in the past several years as a result of a number of factors, including Russian annexation of Crimea and destabilization of eastern Ukraine in 2014. This article argues that alliance unity among the great democracies of Europe and North America is indispensable to peace and stability on the Eurasian continent. A fractured NATO, and especially, a large divide in purposes or commitments as between the United States and its European security partners, invites aggression and the possibility of inadvertent escalation. Past successes and failures in US-involved multinational peace and stability operations, within and outside of Europe, show that mission accomplishment requires give and take, including the occasional acceptance of unequal costs and benefits among the members, in order to achieve peace and security objectives.     

Warehouse sizing to minimize inventory and storage costs

This paper considers a warehouse sizing problem whose objective is to minimize the total cost of ordering, holding, and warehousing of inventory. Unlike typical economic lot sizing models, the warehousing cost structure examined here is not the simple unit rate type, but rather a more realistic step function of the warehouse space to be acquired. In the cases when only one type of stock‐keeping unit (SKU) is warehoused, or when multiple SKUs are warehoused, but, with separable inventory costs, closed form solutions are obtained for the optimal warehouse size. For the case of multi‐SKUs with joint inventory replenishment cost, a heuristic with a provable performance bound of 94% is provided. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 299–312, 2001     

战场信息资源共享平台

针对现行指挥自动化系统在战场信息广泛共享上的差距,构建战场信息共享平台(PW IRS:P latform on W ar-F ie ld In form ation R esources Sharing)模型,提出了战场信息共享平台的体系结构,并在上述的基础上,实现了战场信息资源共享平台的实验原型。     

Distribution free bounds for service constrained (Q,r) inventory systems

A classical and important problem in stochastic inventory theory is to determine the order quantity (Q) and the reorder level (r) to minimize inventory holding and backorder costs subject to a service constraint that the fill rate, i.e., the fraction of demand satisfied by inventory in stock, is at least equal to a desired value. This problem is often hard to solve because the fill rate constraint is not convex in (Q, r) unless additional assumptions are made about the distribution of demand during the lead‐time. As a consequence, there are no known algorithms, other than exhaustive search, that are available for solving this problem in its full generality. Our paper derives the first known bounds to the fill‐rate constrained (Q, r) inventory problem. We derive upper and lower bounds for the optimal values of the order quantity and the reorder level for this problem that are independent of the distribution of demand during the lead time and its variance. We show that the classical economic order quantity is a lower bound on the optimal ordering quantity. We present an efficient solution procedure that exploits these bounds and has a guaranteed bound on the error. When the Lagrangian of the fill rate constraint is convex or when the fill rate constraint does not exist, our bounds can be used to enhance the efficiency of existing algorithms. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 635–656, 2000