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.     

A two product dynamic economic lot size production model with either-or production constraints

This paper considers the production of two products with known demands over a finite set of periods. The production and inventory carrying costs for each product are assumed to be concave. We seek the minimum cost production schedule meeting all demands, without backlogging, assuming that at most one of the two products can be produced in any period. The optimization problem is first stated as a nonlinear programming problem, which allows the proof of a result permitting the search for the optimal policy to be restricted to those which produce a product only when its inventory level is zero. A dynamic programming formulation is given and the model is then formulated as a shortest route problem in a specially constructed network.     

An experimental comparison of solution algorithms for the single-machine tardiness problem

A basic problem in scheduling involves the sequencing of a set of independent tasks at a single facility with the objective of minimizing mean tardiness. Although the problem is relatively simple, the determination of an optimal sequence remains a challenging combinatorial problem. A number of algorithms have been developed for finding solutions, and this paper reports a comparative evaluation of these procedures. Computer programs for five separate algorithms were written and all were run on a data base designed to highlight computational differences. Optimizing algorithms developed by Emmons and by Srinivasan appeared to be particularly efficient in the comparative study.     

Scheduling to minimize the total compression and late costs

We consider a single-machine scheduling model in which the job processing times are controllable variables with linear costs. The objective is to minimize the sum of the cost incurred in compressing job processing times and the cost associated with the number of late jobs. The problem is shown to be NP-hard even when the due dates of all jobs are identical. We present a dynamic programming solution algorithm and a fully polynomial approximation scheme for the problem. Several efficient heuristics are proposed for solving the problem. Computational experiments demonstrate that the heuristics are capable of producing near-optimal solutions quickly. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 67–82, 1998     

Scheduling with centralized and decentralized batching policies in concurrent open shops

This article considers batch scheduling with centralized and decentralized decisions. The context of our study is concurrent open shop scheduling where the jobs are to be processed on a set of independent dedicated machines, which process designated operations of the jobs in batches. The batching policy across the machines can be centralized or decentralized. We study such scheduling problems with the objectives of minimizing the maximum lateness, weighted number of tardy jobs, and total weighted completion time, when the job sequence is determined in advance. We present polynomial time dynamic programming algorithms for some cases of these problems and pseudo‐polynomial time algorithms for some problems that are NP‐hard in the ordinary sense. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 58: 17–27, 2011     

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.     

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.     

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.     

Command and Control of India's Nuclear Forces

The Indian government has not made a public comment about the status of its nuclear weapon program since approving a nuclear doctrine in 2003. However, there is now enough information in the public domain to determine that the command-and-control system for the nuclear program has steadily matured in accordance with the intent of the approved nuclear doctrine. The Indian government has successfully mitigated many of the issues that plague the conventional military. The result is a basic command-and-control system that is focused only on the delivery, if ordered by the prime minister, of nuclear weapons. The system is not as robust as those of the United States and Russia, but is in place and ready as new Indian nuclear weapons enter into operation. The command-and-control system is developing to meet India's needs and political compulsions, but not necessarily as part of a more assertive nuclear policy.