Scheduling prowler training

The U.S. Navy Prowler aircraft is designed for electronic surveillance and countermeasures. In this paper, we describe the problem of scheduling Prowler crew training, and we present two integer programming models to solve it. The first model maximizes the number of aviators trained above 75% in each mission area, subject to the available number of flights, over a single month. The second model distinguishes peacetime from mobilization, and minimizes the number of flights done in mobilization subject to the available number of flights in peacetime. Our models distinguish different types of crew and allow more than one qualification to be earned on a given flight. We give numerical results using real data, comparing our results to the actual readiness of a squadron. We found that crew readiness of Prowler squadrons can be increased by 10%, simply by better scheduling. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 289–305, 2003.     

Duality in constrained multi‐facility location models

We consider the ??_p‐norm multi‐facility minisum location problem with linear and distance constraints, and develop the Lagrangian dual formulation for this problem. The model that we consider represents the most general location model in which the dual formulation is not found in the literature. We find that, because of its linear objective function and less number of variables, the Lagrangian dual is more useful. Additionally, the dual formulation eliminates the differentiability problem in the primal formulation. We also provide the Lagrangian dual formulation of the multi‐facility minisum location problem with the ??_pb‐norm. Finally, we provide a numerical example for solving the Lagrangian dual formulation and obtaining the optimum facility locations from the solution of the dual formulation. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 410–421, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10010     

Rare‐event component importance for the consecutive‐k system

Various indices of component importance with respect to system reliability have been proposed. The most popular one is the Birnbaum importance. In particular, a special case called uniform Birnbaum importance in which all components have the same reliability p has been widely studied for the consecutive‐k system. Since it is not easy to compare uniform Birnbaum importance, the literature has looked into the case p = ½, p → 1, or p ≥ ½. In this paper, we look into the case p → 0 to complete the spectrum of examining Birnbaum importance over the whole range of p. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 159–166, 2002; DOI 10.1002/nav.10001     

Determination of efficient points in multiple-objective location problems

This article is devoted to an MCDM problem connected with locational analysis. The MCDM problem can be formulated so as to minimize the distance between a facility and a given set of points. The efficient points of this problem are candidates for optimal solutions to many location problems. We propose an algorithm to find all efficient points when distance is measured by any polyhedral norm.     

Entropy-based selection with multiple objectives

In this article we present an approach to determine the initially unspecified weights in an additive measurable multiattribute value function. We formulate and solve a series of nonlinear programming problems which (1) incorporate whatever partial information concerning the attribute weights or overall relative value of alternatives the decision maker chooses to provide, yet (2) yield a specific set of weights as a result. Although each formulation is rather easily solved using the nonlinear programming software GINO (general interactive optimizer), solutions in closed form dependent on a single parameter are also provided for a number of these problems.     

Do Employers Favor those with Military Experience in the U.S. Reserve Forces? Evidence from a Field Experiment

This study examines whether completed service in the military reserves results in a civilian labor market benefit. Reservists are not completely absent from the civilian labor market during their military service, possibly allowing them to receive the benefits associated with military experience without forgoing valuable civilian labor market experience. Using a resume study, the results suggest that completed service in the military reserves, relative to no military experience, increases the probability of receiving a request for an interview by 19%.     

See the light: Optimization of put-to-light order picking systems

Put-to-light order picking systems invert the basic logic of conventional picker-to-parts systems. Instead of successively visiting the storage positions of the stock keeping units (SKUs) when collecting picking orders, an order picker accompanies successive bins each containing multiple items of a specific SKU along a lane of subsequent orders. Whenever the picker passes an order requiring the current SKU, which is indicated by a light signal, she puts the requested number of items into the bin associated with the order. Such an order picking system is well-suited if the assortment is not overly large and all orders demand similar SKUs, so that it is mainly applied in distribution centers of brick-and-mortar retail chains. This paper evaluates four different setups of put-to-light systems, which, during operations, require the solution of different storage assignment and SKU sequencing problems. We formulate these problems, prove computational complexity, and suggest suited solution algorithms. By applying these algorithms in a comprehensive computational study, we benchmark the impact of the four different setups on picking performance. In this way, warehouse managers receive decision support on how to set up their put-to-light systems.     

Interactive optimization methodology for fleet scheduling

This article addresses the problem of scheduling the United States Navy's Atlantic Fleet to satisfy overseas strategic requirements. An integer programming formulation is developed but results in a model with prohibitive size. This fact and the qualitative nature of additional secondary objectives and constraints suggest an interactive optimization approach. A system that solves a natural relaxation of the integer program within an interactive environment is discussed.