Incorporating redundancy considerations into stockage models

This article is concerned with evaluating the impact on weapon system availability of component and assembly redundancy. The evaluation must be efficient, and it must be possible to integrate the evaluation into multiechelon stockage models whose objective is to find the least cost mix of stockage consistent with the availability goals for weapon (or other type) systems. The mathematics to be discussed here provides a rigorous solution to the evaluation problem when there is only a single supply echelon; there can be upper-echelon repair, but not supply, unless the supply is from a “perfect” supplier, always in stock. For the more general multiechelon case, approximate approaches are presented.     

Facility location on a grid with a diagonal line

This article extends the traditional median problem on a grid to include a diagonal line (e.g., a street). In contrast to the traditional median problem, this generalized problem is nonconvex and nonseparable, invalidating some of the properties on which well-known median-seeking algorithms are based. This work presents an algorithm for finding the median on this generalized grid and discusses the relationship between it and the traditional median.     

Assemble to order and assemble in advance in a single-period stochastic environment

Faced with stochastic demand, a firm may decide to assemble its products in advance or assemble them once actual demand is realized. In general, the production cost for items assembled in advance (AIA) is lower than for items assembled to order (ATO), because there is no need to expedite, and the production process can be planned and executed well in advance. On the other hand, items assembled in advance (AIA) for which there is no demand incur excessive and unnecessary assembly costs. The two policies, AIA and ATO, as well as a composite one, are compared and analyzed in light of these trade-offs. The composite model, which is shown as the dominating policy, is also extended to deal with the following two scenarios. The first assumes a loss of a fraction of the demand when demand cannot be satisfied from the shelf but rather through ATO. The second considers the effects of budget constraints on the total inventory cost. © 1995 John Wiley & Sons, Inc.     

Single-machine scheduling with early and tardy completion costs

We address a single-machine scheduling problem in which penalties are assigned for early and tardy completion of jobs. These penalties are common in industrial settings where early job completion can cause the cash commitment to resources in a time frame earlier than needed, giving rise to early completion penalties. Tardiness penalties arise from a variety of sources, such as loss of customer goodwill, opportunity costs of lost sales, and direct cash penalties. Accounting for earliness cost makes the performance measure nonregular, and this nonregularity has apparently discouraged researchers from seeking solutions to this problem. We found that it is not much more difficult to design an enumerative search for this problem than it would be if the performance measure were regular. We present and demonstrate an efficient timetabling procedure which can be embedded in an enumerative algorithm allowing the search to be conducted over the domain of job permutations.© 1993 John Wiley & Sons, Inc.     

Discrete repairable reliability systems

Consider a reliability system consisting of n components. The failures and the repair completions of the components can occur only at positive integer-valued times k ϵ N₊₊ ϵ (1, 2, …). At any time k ϵ N₊₊ each component can be in one of two states: up (i.e., working) or down (i.e., failed and in repair). The system state is also either up or down and it depends on the states of the components through a coherent structure function τ. In this article we formulate mathematically the above model and we derive some of its properties. In particular, we identify conditions under which the first failure times of two such systems can be stochastically ordered. A variety of special cases is used in order to illustrate the applications of the derived properties of the model. Some instances in which the times of first failure have the NBU (new better than used) property are pointed out. © 1993 John Wiley & Sons, Inc.     

A search game with a protector

A classic problem in Search Theory is one in which a searcher allocates resources to the points of the integer interval [1, n] in an attempt to find an object which has been hidden in them using a known probability function. In this paper we consider a modification of this problem in which there is a protector who can also allocate resources to the points; allocating these resources makes it more difficult for the searcher to find an object. We model the situation as a two‐person non‐zero‐sum game so that we can take into account the fact that using resources can be costly. It is shown that this game has a unique Nash equilibrium when the searcher's probability of finding an object located at point i is of the form (1 − exp (−λ_ix_i)) exp (−μ_iy_i) when the searcher and protector allocate resources x_i and y_i respectively to point i. An algorithm to find this Nash equilibrium is given. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47:85–96, 2000     

Solving a selected class of location problems by exploiting problem structure: A decomposition approach

For many combinatorial optimization problems that are NP-hard, a number of special cases exist that can be solved in polynomial time. This paper addresses the issue of solving one such problem, the well-known m-median problem with mutual communication (MMMC), by exploiting polynomially solvable special cases of the problem. For MMMC, a dependency graph is defined that characterizes the structure of the interactions between decision variables. A Lagrangian decomposition scheme is proposed that partitions the problem into two or more subproblems, each having the same structure as the original problem, but with simpler dependency graphs. The dual problems are solved using subgradient or multiplier adjustment methods. An efficient method of adjusting the multiplier values is given. Computational results are reported that show the method to be quite effective. In addition, applications of the approach to other difficult location problems is discussed. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 791–815, 1998     

Pareto-optimality in classical inventory problems

In this paper the inventory problem with backorders both deterministic and stochastic is studied using trade-off analysis in the context of vector optimization theory. The set of Pareto-optimal solutions is geometrically characterized in both the constrained and unconstrained cases. Moreover, a new way of utilizing Pareto-optimality concepts to handle classical inventory problems with backorders is derived. A new analysis of these models is done by means of a trade-off analysis. New solutions are shown, and an error bound for total inventory cost is provided. Other models such as multi-item or stochastic lead-time demand inventory problems are addressed and their Pareto-optimal solution sets are obtained. An example is included showing the additional applicability of this kind of analysis to handle parametric problems. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 83–98, 1998