Analysis of production lines with Coxian service times and no intermediate buffers

This paper uses the holding time model (HTM) method to derive an approximate analytic formula for the calculation of the mean throughput of a K-station production line with no buffers between any two successive stations. Service times follow the two-stage Coxian (C²) distribution at all stations. The paper provides a formula that relates the third moment of the service completion (or virtual service) time with the respective parameters of the service time, the repair time and the time to breakdown (the latter is assumed to follow the exponential distribution). In this way, it concludes that under certain conditions the two-stage Coxian distribution can be used to approximate any general distribution matching the first three moments of the service completion time distribution. The mean holding times (consisting of the service and blocking periods) of all stations of the line are obtained in an analytical form. Numerical results are provided for the mean throughput of lines with up to 20 stations. These results are shown to have a good accuracy compared against results obtained from the Markovian state method (for short lines) and results from simulation (for longer lines). © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 669–685, 1998     

Scheduling to minimize release-time resource consumption and tardiness penalties

We consider the problem of scheduling a set of jobs with a common due-date on a single-machine where the release time of a job is related to the amount of resource consumed. The objective is to minimize the total resource consumption and the total tardiness. While the problem is strongly NP-hard in general, we discuss two different special cases for which special properties are identified and used to develop efficient pseudo-polynomial time algorithms. © 1995 John Wiley & Sons, Inc.     

Pirates – The Young and the Jobless: The Effect of Youth Bulges and Youth Labor Market Integration on Maritime Piracy

This article examines the impact of youth bulges and the lack of perspective of this cohort associated with the insufficient absorption of the labor market on the emergence of piracy acts. For a large panel data-set on maritime piracy and armed robbery against ships for the period 1990–2015 negative binomial regression results indicate that a large fraction of young people in a country increases the likelihood of piracy attacks originating from that country. Further, the piracy-driving effect is conditional on constrains in the labor market. It increases when the young population is insufficiently integrated into the labor market and becomes insignificant for high levels of labor force participation. The dearth of prospects seems to lower the inhibition to make a living from criminal activity.     

Land power in the age of joint interdependence: toward a theory of land power for the twenty-first century*

This essay outlines a theory of land power. After explaining the absence of such a theory, the article establishes the modern context for such a theory, specifically within the concept of joint interdependence. The analysis defines key terms and premises behind the theory, to include a definition of land power. The argument then outlines the national elements of power that contribute to a theory of land power. The analysis next applies the theory to the fundamental purposes of military power: defeat, deter, compel, assure, shape and support to the nation. The analysis then tests key definitions, supporting premises, and utility of the theory. The essay argues that historical experience validates the applicability and utility of the theory, and offers a solid basis for extrapolating the validity of the theory into the near future.     

An exact branch‐and‐price algorithm for multitasking scheduling on unrelated parallel machines

We consider the multitasking scheduling problem on unrelated parallel machines to minimize the total weighted completion time. In this problem, each machine processes a set of jobs, while the processing of a selected job on a machine may be interrupted by other available jobs scheduled on the same machine but unfinished. To solve this problem, we propose an exact branch‐and‐price algorithm, where the master problem at each search node is solved by a novel column generation scheme, called in‐out column generation, to maintain the stability of the dual variables. We use a greedy heuristic to obtain a set of initial columns to start the in‐out column generation, and a hybrid strategy combining a genetic algorithm and an exact dynamic programming algorithm to solve the pricing subproblems approximately and exactly, respectively. Using randomly generated data, we conduct numerical studies to evaluate the performance of the proposed solution approach. We also examine the effects of multitasking on the scheduling outcomes, with which the decision maker can justify making investments to adopt or avoid multitasking.     

Stochastic production capacity: A bane or a boon for quick response supply chains?

The quick response (QR) system that can cope with demand volatility by shortening lead time has been well studied in the literature. Much of the existing literature assumes implicitly or explicitly that the manufacturers under QR can always meet the demand because the production capacity is always sufficient. However, when the order comes with a short lead time under QR, availability of the manufacturer's production capacity is not guaranteed. This motivates us to explore QR in supply chains with stochastic production capacity. Specifically, we study QR in a two-echelon supply chain with Bayesian demand information updating. We consider the situation where the manufacturer's production capacity under QR is uncertain. We first explore how stochastic production capacity affects supply chain decisions and QR implementation. We then incorporate the manufacturer's ability to expand capacity into the model. We explore how the manufacturer determines the optimal capacity expansion decision, and the value of such an ability to the supply chain and its agents. Finally, we extend the model to the two-stage two-ordering case and derive the optimal ordering policy by dynamic programming. We compare the single-ordering and two-ordering cases to generate additional managerial insights about how ordering flexibility affects QR when production capacity is stochastic. We also explore the transparent supply chain and find that our main results still hold.     

Purchase and retrieval competition for seasonal produce

We study the competition problem of purchase and multiretrieval of perishable seasonal produce, where wholesalers purchase and stock their products in the first period, and then retrieve and sell them in subsequent periods. We first consider the duopoly case and assume that the prices are exogenous and fluctuate. In each period, after the price realization, the wholesalers retrieve some stock from their warehouses to satisfy their demands. One wholesaler's unsatisfied customers can switch to another and be satisfied by its left retrieved products. Any unsold retrieved stock has no salvage value and any unsatisfied demand is lost. The unretrieved stock is carried to the next period at a perishable rate. The wholesalers compete for the substitute demand by determining their own purchase and retrieval quantities. We show the existence and uniqueness of a pure-strategy Nash equilibrium, and that the Nash equilibrium strategy has the simple “sell-down-to” structure. We also consider the general N-person game and show the existence of the Nash equilibrium, and characterize the structure of the equilibrium strategy for the symmetric case. In addition, we consider the case with endogenous prices, and show that the problem reduces to a repeated newsvendor game with price and inventory competition. We derive the conditions under which a unique Nash equilibrium exists and characterize the equilibrium strategy. Finally, we conduct numerical studies to examine the impacts of the model parameters on the equilibrium outcomes and to generate managerial insights.     

International Norms in Ethno-Territorial Disputes: Legitimacy and Efficacy in Outsiders’ Views of Independence and Irredentism

Ethno-national territorial disputes typically involve conflicting homeland claims between states and minority ethnic groups. Where such minority ethnic groups have cross-border ethnic kin who themselves constitute a dominant or influential ethnic group in a neighbouring state, separatist goals may take the form of either irredentism or independence. We conjecture that external sympathy for irredentism and independence may vary significantly, and that this variation may be an important influence in situations where secessionist groups and ethnic kin states have a choice between the two goals. Using a bargaining framework that controls for variation in relative power, status quo conditions and minority-side leadership preferences, we present experimental evidence indicating that external audiences are likely to support more confrontational policies in pursuit of independence than in pursuit of irredentism. Our evidence also indicates that independence attracts greater support largely because outsiders perceive it as a more legitimate goal; and that practical efficacy is not important in stimulating sympathy for either independence or irredentism. These results also support a broader argument in the literature on international norms – that such norms receive support not only because they may justify pre-existing goals or interests, but also because they are perceived as having greater legitimacy per se.     

Explicit modeling of detection within a stochastic duel

Many mathematical models have been formulated to describe combat between two weapon systems. However, until recently duel models did not explicitly represent target detection within a duel, leading to the necessity for the development of new model for each tactical situation. An earlier article by two of the authors described a duel between weapons with constant firing times and explicit modeling of detection. This article enhances the study of this form of duel between weapons by introducing a variable parameter for firing times. This enhancement removes the discontinuities evident during parametric analysis of the earlier model and hence provides a more coherent model of this combat situation. © 1993 John Wiley & Sons, Inc.     

Localization of optimal strategies in certain games

Assume the payoffs of a matrix game are concave in the index of the maximizing player. That player is shown to have an optimal strategy which uses at most two consecutive pure strategies, identifiable through approximate solution of a related continuous game. Generalizations are given, and the results are applied to a motivating hidden-target model due to Shapley. © 1994 John Wiley & Sons, Inc.