Optimization methods for large-scale multiechelon stockage problems

I examine the problem of determining inventory stockage levels and locations of different parts in a multiechelon system. This stockage problem is complicated by parts commonality—each part may be used by several different end items. Stockage levels and locations of each part affect the availability of end items that use the part, since an end item will be out of service if it requires a part that is not available. Of course, if the part is available at another nearby location, then the end item will be out of service for a shorter period of time. An essential feature of any model for this problem is constraints on operational availability of the end items. Because these constraints would involve nonconvex functions if the stockage levels were allowed to vary continuously, I formulate a 0–1 linear optimization model of the stockage problem. In this model, each part can be stocked at any of a number of prespecified levels at each echelon. The model is to minimize stockage cost of the selected items subject to the end-item availability constraints and limits on the total weight, volume, and number of different parts stocked at each echelon. Advantages and disadvantages of different Lagrangian relaxations and the simplex method with generalized upper-bounding capability are discussed for solving this stockage model.     

Note: Facility location with closest rectangular distances

This paper considers the problem of locating one or more new facilities on a continuous plane, where the destinations or customers, and even the facilities, may be represented by areas and not points. The objective is to locate the facilities in order to minimize a sum of transportation costs. What is new in this study is that the relevant distances are the distances from the closest point in the facility to the closest point in the demand areas. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 77–84, 2000     

On the busy period of the M/G/1 retrial queue

The M/G/1 queue with repeated attempts is considered. A customer who finds the server busy, leaves the service area and joins a pool of unsatisfied customers. Each customer in the pool repeats his demand after a random amount of time until he finds the server free. We focus on the busy period L of the M/G/1$ retrial queue. The structure of the busy period and its analysis in terms of Laplace transforms have been discussed by several authors. However, this solution has serious limitations in practice. For instance, we cannot compute the first moments of L by direct differentiation. This paper complements the existing work and provides a direct method of calculation for the second moment of L. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 115–127, 2000     

Asymptotically optimal linear time algorithms for two‐stage and three‐stage flexible flow shops

We consider two‐stage and three‐stage flexible flow shops with parallel machines in each stage and the minimum makespan objective. We develop linear time algorithms for these problems with absolute worst‐case bounds either sharper or no worse than the currently available ones and we accomplish this with lower complexity algorithms. We also demonstrate the asymptotic optimality of a class of algorithms for multistage flexible flow shop problems (which includes the proposed algorithms) under certain probabilistic assumptions on the job processing times. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 259–268, 2000     

The impact of exponential smoothing forecasts on the bullwhip effect

An important phenomenon often observed in supply chain management, known as the bullwhip effect, implies that demand variability increases as one moves up the supply chain, i.e., as one moves away from customer demand. In this paper we quantify this effect for simple, two‐stage, supply chains consisting of a single retailer and a single manufacturer. We demonstrate that the use of an exponential smoothing forecast by the retailer can cause the bullwhip effect and contrast these results with the increase in variability due to the use of a moving average forecast. We consider two types of demand processes, a correlated demand process and a demand process with a linear trend. We then discuss several important managerial insights that can be drawn from this research. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 269–286, 2000     

Pakistani Political Communication and Public Opinion on US Drone Attacks

Conventional wisdom holds that Pakistanis are overwhelmingly opposed to American drone strikes in their country’s tribal areas and that this opposition is driven by mass media coverage of the loss of life and property the strikes purportedly cause. Using an approach based in the literature in political communication and public opinion, we argue this conventional wisdom is largely inaccurate. Instead, we contend that awareness of drone strikes will be limited because Pakistan is a poor country with low educational attainment, high rates of illiteracy and persistent infrastructure problems that limit access to mass media. Moreover, because of these same country characteristics, Pakistanis’ beliefs about drone strikes will be shaped primarily by informal, face-to-face political communication, rather than through more formal media sources. We test this argument using data that we collected by fielding a 7,656 respondent, nationally-representative survey carried out in Pakistan in 2013. The results of the statistical analysis support our arguments.     

Military expenditure and economic growth in Middle Eastern countries and Turkey: a non-linear panel data approach

The economic growth effects of military expenditure have been the subject of a large literature in defence economics. Theories on the economic impacts of military expenditure greatly differ and include arguments that they either enhance economic growth or crowd out productive investments. Empirical literature on defence expenditure and economic growth nexus generally employs linear specifications to investigate the impact of defence expenditures on economic growth. Although it is now well established that many economic variables may have a non-linear data-generating mechanism, it seems that this reality has long been neglected in empirical work on defence–growth nexus. This paper attempts to fill this gap by employing non-linear panel data models to examine the effects of military expenditures on economic growth for Middle Eastern countries and Turkey, for the time period 1988–2012. Results show that the effect of military expenditure on economic growth is nonlinear such that the state of the economy actually determines the effect of the former on the latter. This is important not only in showing asymmetric relationship between these variables but also in revealing the reasons of mixed results of earlier literature.     

Class scheduling algorithms for Navy training schools

The problem of developing good schedules for Navy C-Schools has been modeled as a combinatorial optimization problem. The only complicating feature of the problem is that classes must be grouped together into sequences known as pipelines. An ideal schedule will have all classes in a pipeline scheduled in consecutive weeks. The objective is to eliminate the nonproductive time spent by sailors at C-Schools who are waiting for the next class in a pipeline. In this investigation an implicit enumeration procedure for this problem was developed. The key component of our algorithm is a specialized greedy algorithm which is used to obtain a good initial incumbent. Often this initial incumbent is either an optimal schedule or a near optimal schedule. In an empirical analysis with the only other competing software system, our greedy heuristic found equivalent or better solutions in substantially less computer time. This greedy heuristic was extended and modified for the A-School scheduling problem and was found to be superior to its only competitor. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 533–551, 1998     

Vehicle fleet refueling strategies to maximize operational range

The focus of this research is on self-contained missions requiring round-trip vehicle travel from a common origin. For a single vehicle the maximal distance that can be reached without refueling is defined as its operational range. Operational range is a function of a vehicle's fuel capacity and fuel consumption characteristics. In order to increase a vehicle's range beyond its operational range replenishment from a secondary fuel source is necessary. In this article, the problem of maximizing the range of any single vehicle from a fleet of n vehicles is investigated. This is done for four types of fleet configurations: (1) identical vehicles, (2) vehicles with identical fuel consumption rates but different fuel capacities, (3) vehicles which have the same fuel capacity but different fuel consumption rates, and (4) vehicles with both different fuel capacities and different consumption rates. For each of the first three configurations the optimal refueling policy that provides the maximal range is determined for a sequential refueling chain strategy. In such a strategy the last vehicle to be refueled is the next vehicle to transfer its fuel. Several mathematical programming formulations are given and their solutions determined in closed form. One of the major conclusions is that for an identical fleet the range of the farthest vehicle can be increased by at most 50% more than the operational range of a single vehicle. Moreover, this limit is reached very quickly with small values of n. The performance of the identical fleet configuration is further investigated for a refueling strategy involving a multiple-transfer refueling chain, stochastic vehicle failures, finite refueling times, and prepositioned fleets. No simple refueling ordering rules were found for the most general case (configuration 4). In addition, the case of vehicles with different fuel capacities is investigated under a budget constraint. The analysis provides several benchmarks or bounds for which more realistic structures may be compared. Some of the more complex structures left for future study are described.