Sojourn time analysis of a queueing system with two‐phase service and server vacations

We consider a two‐phase service queueing system with batch Poisson arrivals and server vacations denoted by M^X/G₁‐G₂/1. The first phase service is an exhaustive or a gated bulk service, and the second phase is given individually to the members of a batch. By a reduction to an M^X/G/1 vacation system and applying the level‐crossing method to a workload process with two types of vacations, we obtain the Laplace–Stieltjes transform of the sojourn time distribution in the M^X/G₁‐G₂/1 with single or multiple vacations. The decomposition expression is derived for the Laplace–Stieltjes transform of the sojourn time distribution, and the first two moments of the sojourn time are provided. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

What you should know about queueing models to set staffing requirements in service systems

One traditional application of queueing models is to help set staffing requirements in service systems, but the way to do so is not entirely straightforward, largely because demand in service systems typically varies greatly by the time of day. This article discusses ways—old and new—to cope with that time‐varying demand. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

A branch‐and‐price algorithm for a targeting problem

In this paper, we consider a new weapon‐target allocation problem with the objective of minimizing the overall firing cost. The problem is formulated as a nonlinear integer programming model, but it can be transformed into a linear integer programming model. We present a branch‐and‐price algorithm for the problem employing the disaggregated formulation, which has exponentially many columns denoting the feasible allocations of weapon systems to each target. A greedy‐style heuristic is used to get some initial columns to start the column generation. A branching strategy compatible with the pricing problem is also proposed. Computational results using randomly generated data show this approach is promising for the targeting problem. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Tail hazard rate ordering properties of order statistics and coherent systems

We study tail hazard rate ordering properties of coherent systems using the representation of the distribution of a coherent system as a mixture of the distributions of the series systems obtained from its path sets. Also some ordering properties are obtained for order statistics which, in this context, represent the lifetimes of k‐out‐of‐n systems. We pay special attention to systems with components satisfying the proportional hazard rate model or with exponential, Weibull and Pareto type II distributions. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

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     

The strategic effects of a merger upon supplier interactions

We consider how a merger between two naturally differentiated dealers affects their interactions with a common supplier and identify conditions under which the merger can increase or decrease the combined net worth of the two firms. Among other things, we find that the attractiveness of merging depends upon the extent to which end demand can be stimulated by either an upstream supplier or the dealers. Specifically, the greater the supplier's ability to invest in stimulating end demand, the more likely it is that the naturally differentiated firms will be better off operating independently than merging. On the other hand, if the greatest opportunities for stimulating demand are through the service that is provided by the dealers, then merging their operations will be more attractive. © 2006 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     

浅谈部门预算中项目预算的管理

本文就部门预算的基本原则、编制方法进行了深入的论述,对部门预算中存在的问题做了深入的分析,并就这些问题的解决做了系统的论述。     

批量独立可修件的备件需求预测仿真算法

利用Monte Carlo随机仿真技术,采用事件调度法的仿真策略对可修件的使用与维修过程进行仿真,给出了在给定备件和维修分队数量下批量独立可修件的备件保障概率仿真算法,并用一系列计算实例证明了算法的可行性和正确性,该算法能有效解决安装在不同装备上,具有不同已工作时间、不同故障间隔时间分布、不同修复时间分布的可修件的备件保障概率计算问题,为备件的科学储备提供了有力的决策依据。