Multiperiod resource allocation with a smoothing objective

We consider a multiperiod resource allocation problem, where a single resource is allocated over a finite planning horizon of T periods. Resource allocated to one period can be used to satisfy demand of that period or of future periods, but backordering of demand is not allowed. The objective is to allocate the resource as smoothly as possible throughout the planning horizon. We present two models: the first assumes that the allocation decision variables are continuous, whereas the second considers only integer allocations. Applications for such models are found, for example, in subassembly production planning for complex products in a multistage production environment. Efficient algorithms are presented to find optimal allocations for these models at an effort of O(T²). Among all optimal policies for each model, these algorithms find the one that carries the least excess resources throughout the planning horizon. © 1995 John Wiley & Sons, Inc.     

CIVIL CONTROL OF THE ZAMBIAN MILITARY SINCE INDEPENDENCE

Democratic rule requires, amongst other things, orderly civil-military relations. Zambia's military, with some exceptions, have generally remained under firm civilian control, unlike many forces in the region. Initially the military was based on the British colonial model but during the struggle for independence the force was indigenised. Instead of representing a colonial power, the military came to represent a specific political viewpoint: one party participatory democracy. President Kaunda, the leader of UNIP, was chiefly responsible for the politicisation of the military and ensuring its loyalty to the ruling party. Quasi-military institutions such as the Combined Cadet Force and the Home Guard Unit were useful links between civilian and military personnel. When Frederick Chiluba, leader of the MMD, took over in 1991 he tried to make the military more professional and curb its power over civilian affairs. A defence council and parliamentary regulation were instituted to avoid further military coups.     

Icons Off the Mark

In two landmark articles, longtime scholars Kenneth N. Waltz and Thomas C. Schelling have re-emphasized the utility of nuclear deterrence over nuclear nonproliferation (Waltz) and nuclear disarmament (Schelling). While the thrust of the articles is seemingly different, both are rooted in the same intellectual ground: an epistemology that assumes problem-free inferences, drawn from past experiences, are applicable in future scenarios; a foundational rooting in strategic rationality that entangles them in unsolvable contradictions concerning comparable risks of different nuclear constellations, namely deterrence versus proliferation and disarmament; and a bias in framing the empirical record that makes nuclear deterrence more conducive to security than nuclear disarmament. The common normative-practical denominator, then, is to let a nuclear weapon-free world appear both less desirable and less feasible than it might actually be.     

Algorithmic and approximation analyses of the shorter queue model

A system of two parallel queues where the arrivals from a single stream of customers join the shorter queue is considered. Arrivals form a homogeneous Poisson stream and the service times in each of the two queues are independent exponential variates. By treating one of the queues as bounded, the steady-state probability vector for the system can be expressed in a modified matrix-geometric form and can be computed efficiently. Computational procedures for the sojourn time distribution and characteristics of the departure stream are developed. Some numerical results are presented, and based on these results an efficient approximation scheme for the model is developed which can be readily extended to systems with more than two parallel queues.     

MIDDLE EAST NONPROLIFERATION

The Middle East is a crucial region for the global nonproliferation regime. In 2010, the state parties to the Treaty on the Non-Proliferation of Nuclear Weapons proposed a conference on a Middle East Weapons of Mass Destruction-Free Zone. The nuclear weapon-free zone model, on which this idea builds, has achieved important results in other regions, but faces especially stark challenges in the Middle East. However, the attempt to apply the boldly imaginative zone approach to the Middle East holds promise for building a more inclusive dialogue on nonproliferation and regional security.     

Parameter estimation for the EOQ lot-size model: Minimax and expected value choices

This article provides formulas for estimating the parameters to be used in the basic EOQ lot-size model. The analysis assumes that the true values of these parameters are unknown over known ranges and perhaps nonstationary over time. Two measures of estimator “goodness” are derived from EOQ sensitivity analysis. Formulas are given for computing the minimax choice and the minimum expected value choice for the parameter estimates using both measures of estimator “goodness”. A numerical example is included.     

An adaptive dynamic programming algorithm for a stochastic multiproduct batch dispatch problem

We address the problem of dispatching a vehicle with different product classes. There is a common dispatch cost, but holding costs that vary by product class. The problem exhibits multidimensional state, outcome and action spaces, and as a result is computationally intractable using either discrete dynamic programming methods, or even as a deterministic integer program. We prove a key structural property for the decision function, and exploit this property in the development of continuous value function approximations that form the basis of an approximate dispatch rule. Comparisons on single product‐class problems, where optimal solutions are available, demonstrate solutions that are within a few percent of optimal. The algorithm is then applied to a problem with 100 product classes, and comparisons against a carefully tuned myopic heuristic demonstrate significant improvements. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 742–769, 2003.     

Exact algorithms for scheduling multiple families of jobs on parallel machines

In many practical manufacturing environments, jobs to be processed can be divided into different families such that a setup is required whenever there is a switch from processing a job of one family to another job of a different family. The time for setup could be sequence independent or sequence dependent. We consider two particular scheduling problems relevant to such situations. In both problems, we are given a set of jobs to be processed on a set of identical parallel machines. The objective of the first problem is to minimize total weighted completion time of jobs, and that of the second problem is to minimize weighted number of tardy jobs. We propose column generation based branch and bound exact solution algorithms for the problems. Computational experiments show that the algorithms are capable of solving both problems of medium size to optimality within reasonable computational time. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 823–840, 2003.