An inventory model of incentives for on-time delivery in just-in-time purchasing contracts

This article formulates an analytic model of just-in-time purchasing contracts and compares the minimum cost solution with the cost attainable through vertical integration. The models use standard inventory theory cost parameters and decision variables. The results quantify the increase in cost of buying an item rather than making it. Optimal incentives are characterized when JIT purchasing contracts are used. When JIT purchasing is implemented, buffer inventories are typically reduced. This inventory reduction makes on-time delivery critical to the buyer; yet timeliness is controlled by the supplier. As an incentive to provide on-time delivery, the buyer offers the supplier a bonus for on-time delivery. The supplier chooses a flow time allowance based upon the bonus offered. First- and second-order conditions are characterized in general, and examples are provided for exponentially and uniformly distributed flow times. The delivery timeliness obtainable in a vertically integrated firm is determined and compared with timeliness obtainable between separate firms. This comparison indicates that buyers who choose to purchase materials from a separate firm are more likely to experience late deliveries. The relationship between the value of the bonus and the proportion of on-time deliveries is also considered. The bonus required to achieve the same probability of on-time delivery as under vertical integration is also determined. © 1993 John Wiley & Sons, Inc.     

An algorithm for the discrete bilevel programming problem

The bilevel programming problem (BLPP) is an example of a two-stage, noncooperative game in which the first player can influence but not control the actions of the second. This article addresses the linear formulation and presents a new algorithm for solving the zero-one case. We begin by converting the leader's objective function into a parameterized constraint, and then attempt to solve the resultant problem. This produces a candidate solution that is used to find a point in the BLPP feasible reagion. Incremental improvements are sought, which ultimately lead to a global optimum. An example is presented to highlight the computations and to demonstrate some basic characteristics of the solution. Computational experience indicates that the algorithm is capable of solving problems with up to 50 variables in a reasonable amount of time.     

A theoretical justification for an increasing average failure rate strength distribution in fibrous composites

A general model for the failure of fibrous composite materials is described. It is shown to contain some of the well-known models in the literature. The composite material is viewed as a coherent system of independent identically distributed component strengths. Under the assumption that the applied load is redistributed “homotonically” to the unfailed components upon the failure of a component (an individual fiber segment) and that the distributions of component strengths are IFRA, it is shown that the system (composite) strength distribution is also IFRA. Examples are given using carbon reinforced composite data to illustrate the IFRA property.     

Exploiting self‐canceling demand point aggregation error for some planar rectilinear median location problems

When solving location problems in practice it is quite common to aggregate demand points into centroids. Solving a location problem with aggregated demand data is computationally easier, but the aggregation process introduces error. We develop theory and algorithms for certain types of centroid aggregations for rectilinear 1‐median problems. The objective is to construct an aggregation that minimizes the maximum aggregation error. We focus on row‐column aggregations, and make use of aggregation results for 1‐median problems on the line to do aggregation for 1‐median problems in the plane. The aggregations developed for the 1‐median problem are then used to construct approximate n‐median problems. We test the theory computationally on n‐median problems (n ≥ 1) using both randomly generated, as well as real, data. Every error measure we consider can be well approximated by some power function in the number of aggregate demand points. Each such function exhibits decreasing returns to scale. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 614–637, 2003.     

Damage functions and estimates of fratricide and collateral damage

There are multiple damage functions in the literature to estimate the probability that a single weapon detonation destroys a point target. This paper addresses differences in the tails of four of the more popular damage functions. These four cover the asymptotic tail behaviors of all monotonically decreasing damage functions with well‐behaved hazard functions. The differences in estimates of probability of kill are quite dramatic for large aim‐point offsets. This is particularly important when balancing the number of threats that can be engaged with the chances of fratricide and collateral damage. In general, analysts substituting one damage function for another may badly estimate kill probabilities in offset‐aiming, which could result in poor doctrine. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 306–321, 2003.     

Building Legitimacy: Interactional Dynamics and the Popular Evaluation of the Kurdistan Workers’ Party (PKK) in Turkey

Abstract

Previous research has identified a variety of general mechanisms to explain how insurgents build legitimacy. Yet, there is often a gap between these mechanisms and the interactional dynamics of insurgencies. This article attempts to bridge this gap through a theoretically informed analysis of the Kurdistan Workers’ Party’s (PKK) insurgency in Turkey. I show how the PKK’s efforts to cultivate legitimacy, Turkey’s counterinsurgency strategies, and civilian perceptions of the PKK, all mutually influenced one another. Based on this analysis, I argue that the mechanisms that produce popular legitimacy coevolve with insurgents’ behaviors, states’ interventions, and civilians’ perceptions.     

A bicriterion approach to common flow allowances due window assignment and scheduling with controllable processing times

We investigate a single‐machine scheduling problem for which both the job processing times and due windows are decision variables to be determined by the decision maker. The job processing times are controllable as a linear or convex function of the amount of a common continuously divisible resource allocated to the jobs, where the resource allocated to the jobs can be used in discrete or continuous quantities. We use the common flow allowances due window assignment method to assign due windows to the jobs. We consider two performance criteria: (i) the total weighted number of early and tardy jobs plus the weighted due window assignment cost, and (ii) the resource consumption cost. For each resource consumption function, the objective is to minimize the first criterion, while keeping the value of the second criterion no greater than a given limit. We analyze the computational complexity, devise pseudo‐polynomial dynamic programming solution algorithms, and provide fully polynomial‐time approximation schemes and an enhanced volume algorithm to find high‐quality solutions quickly for the considered problems. We conduct extensive numerical studies to assess the performance of the algorithms. The computational results show that the proposed algorithms are very efficient in finding optimal or near‐optimal solutions. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 41–63, 2017     

Scheduling with parallel processors and linear delay costs

This paper deals with the sequencing problem of minimizing linear delay costs with parallel identical processors. The theoretical properties of this m-machine problem are explored, and the problem of determining an optimum scheduling procedure is examined. Properties of the optimum schedule are given as well as the corresponding reductions in the number of schedules that must be evaluated in the search for an optimum. An experimental comparison of scheduling rules is reported; this indicates that although a class of effective heuristics can be identified, their relative behavior is difficult to characterize.