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.     

An efficient heuristic procedure for the capacitated warehouse location problem

This paper introduces an efficient heuristic procedure for solving a special class of mixed integer programming problem called the capacitated warehouse (plant) location problem. This procedure parallels the work reported earlier in [9] on the uncapacitated warehouse location problem. The procedure can be viewed as tracing a judiciously selected path of the branch and bound tree (from the initial node to the terminal node) to arrive at a candidate solution. A simple backtracking scheme is also incorporated in the procedure to investigate possible improvement in the solution. Computational results on problems found in the literature look quite encouraging.     

A heuristic network procedure for the assembly line balancing problem

Proposed is a Heuristic Network (HN) Procedure for balancing assembly lines. The procedure uses simple heuristic rules to generate a network which is then traversed using a shortest route algorithm to obtain a heuristic solution. The advantages of the HN Procedure are: a) it generally yields better solutions than those obtained by application of the heuristics, and b) sensitivity analysis with different values of cycle time is possible without having to regenerate the network. The rationale for its effectiveness and its application to problems with paralleling are presented. Computational experience with the procedure on up to 50 task test problems is provided.     

An exact branch-and-bound procedure for the quadratic-assignment problem

The quadratic-assignment problem is a difficult combinatorial problem which still remains unsolved. In this study, an exact branch-and-bound procedure, which is able to produce optimal solutions for problems with twelve facilities or less, is developed. The method incorporates the concept of stepped fathoming to reduce the effort expended in searching the decision trees. Computational experience with the procedure is presented.     

A continuous review inventory model with compound poisson demand process and stochastic lead time

Using Markov renewal theory, we derive analytic expressions for the expected average cost associated with (s, S) policies for a continuous review inventory model with a compound Poisson demand process and stochastic lead time, under the (restrictive) assumption that only one order can be outstanding.     

四轴超精密车床的改进坐标驱动装置

带微进给方式步进电机的PC控制轴系驱动装置可生产光学质量的表面。超精密车床可生产诸如球体和非球体之类的集合体,其表面粗糙度≤5nmRa,可用于光学装置的反光镜或空气轴承转轴的超精密零件。     

Note: Dynamic lot sizing for a finite rate input process

The basic single-product dynamic lot-sizing problem involves determining the optimal batch production schedule to meet a deterministic, discrete-in-time, varying demand pattern subject to linear setup and stockholding costs. The most widely known procedure for deriving the optimal solution is the Wagner-Whitin algorithm, although many other approaches have subsequently been developed for tackling the same problem. The objective of this note is to show how these procedures can readily be adapted when the input is a finite rate production process. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 221–228, 1997