Single machine sequencing with random processing times and random due-dates

A single machine scheduling problem in which both the processing times and due-dates of the jobs awaiting servicing are random variables is analyzed. It is proved that the properties of the shortest processing time rule and the due-date rule which are known for the deterministic situation also hold in the probabilistic environment when they are suitably, and reasonably, refined for this context.     

Evaluation of base-stock policies in multiechelon inventory systems with state-dependent demands part I: State-independent policies

This article analyzes a model of a multiechelon inventory system. The exogenous demands form Markov-modulated Poisson processes. That is, the demand rates are functions of an underlying Markov chain. Each location follows a base-stock policy which is independent of the state of the underlying Markov chain. We employ the exogenous transit mechanism introduced by Zipkin [7] and Svoronos and Zipkin [6]. The transit times between locations have phase-type distributions. An exact procedure to compute steady-state performance measures is presented. © 1992 John Wiley & Sons, Inc.     

The class of mifra lifetimes and its relation to other classes

In a previous paper, the authors have introduced a class of multivariate lifetimes (MIFRA) which generalize the univariate lifetimes with increasing failure rate average (IFRA). They have also shown that this class satisfies many fundamental properties. In this paper it is shown that other concepts of multivariate IFRA do not satisfy all of these properties. Relationships between MIFRA and these other concepts are given. Finally, positive dependence implications with respect to these classes are also discussed.     

A bibliography of search theory and reconnaissance theory literature

This bibliography consists of 75 items on search theory and reconnaissance theory found in periodicals and technical reports. Each entry includes a short summary or a quotation from the pertinent abstract. The items are classified into one or more of the following categories: (1) General Discussion of Problems; (2) Allocation of Effort; (3) Game Theory Formulations; (4) Geometric Search Patterns; (5) Measures of Performance and (6) Miscellaneous.     

Determining the most vital link in a flow network

The most vital link in a single commodity flow network is that are whose removal results in the greatest reduction in the value of the maximal flow in the network between a source node and a sink node. This paper develops an iterative labeling algorithm to determine the most vital link in the network. A necessary condition for an are to be the most vital link is established and is employed to decrease the number of ares which must be considered.     

‘Winston has gone mad’: Churchill,the British Admiralty,and the Rise of Japanese Naval Power

As Chancellor of the Exchequer during the late 1920s, Winston Churchill was at the center of British strategic decision making about how to respond to the naval challenge posed by Japan's rise as a rival sea power. Churchill downplayed the likelihood of war with Japan. The leadership of the Royal Navy disagreed: they saw Japan as a dangerous threat to the security of the British Empire. Examining this dispute between Churchill and the Admiralty highlights the awkward political, economic, and strategic tradeoffs confronting British leaders between the world wars.     

Troubled triangle: Russia,Ukraine and the United States

A potentially productive triangular arrangement among Russia, Ukraine, and the United States emerged in 1994 from efforts to constrain nuclear weapons diffusion. By 2001, this promising initiative was nearly moribund, owing to the inability or unwillingness of the parties to fulfill the commitments of subsequent agreements. The domestic and external causes of this failure are many and clear. Yet the advantages to each of reengaging in a trilateral relationship are also plain. This means fulfilling their unfinished agenda by learning from past mistakes, adopting realistic premises and goals, and pursuing ‘bottom up’ as well as ‘top down’ strategies.     

Order-preserving allocation of jobs to two machines

In this paper, we consider the problem of minimizing the mean flow time of jobs to be processed on two machines. The jobs have a predetermined order, perhaps reflecting the order of arrival, and each job has a known processing time. We wish to assign the jobs to machines so as to minimize the mean flow time, with the constraint that the original order must be preserved within the subset of jobs assigned to each machine. An efficient algorithm based on dynamic programming is developed.