Redistricting, the redrawing of congressional district boundaries within the states, may occur every 10 years on the basis of the population census. Many redistricting plans are designed with partisan politics in mind, resulting in disputes and forcing judges to intervene. We address this...

Erratum to Mairs, Thomas G., Glenn W. Wakefield, Ellis L. Johnson, Kurt Spielberg. 1978. On a production allocation and distribution problem. Management Sci. 24 (November).

We describe a production allocation problem which was worked on at Frito-Lay and an integer programming model formulated for its solution. In connection with model formulation, we discuss estimation and collection of the required cost coefficients. Finally, we report on the use of two different...

A multi-item inventory system with periodic review, single set-up cost K plus linear ordering cost c for changing stock levels, and holding and shortage cost l(x) for being in stock position x at the beginning of a period is considered. Demand in any period is assumed to be \xi with probability...

For the infinite horizon, single item inventory problem, assume an ordering cost M(i) + K(j) for changing the stock level from i to j (for example, M(i) + K(j) - c \cdot (j - i) + K), a holding plus shortage cost l(j), and a probability \varphi (j, k) of demand j - k when the stock level is j....

Airlines are continually faced with the challenge of efficient utilization of their cockpit crew resources. In addition to regular flying crews, airlines maintain significant reserve staffing levels to meet contractual obligations and provide smooth daily operations. Most airlines also depend on...

An algorithm, based on finding a shortest route in a finite directed network, is given for the assembly line balancing problem. Arc lengths are such that it is sufficient to find any path from the origin to destination node containing a minimal number of arcs. Computational results are presented...

A model is developed for planning the intake of employees as a function of time in the face of varying demand for service. The problem is complicated by resignations which, in part, depend on the intake. The model is solved by dynamic programming using a form of successive approximations to...

The number of days required to clear a check drawn on a bank in city j depends on the city i in which the check is cashed. Thus, to maximize its available funds, a company that pays bills to numerous clients in various locations may find it advantageous to maintain accounts in several...

In the course of the deliberations of the 1977 Lanchester Prize Committee, Alan J. Goldman brought to our attention an error in the proof of Lemma 1 of our paper (Cornuejols, G., M. L. Fisher, G. L. Nemhauser. 1977. Location of bank accounts to optimize float: an analytic study of exact and...