A new method for solving the corrugator trim problem is presented. This problem draws its name from the difficult task facing scheduling personnel in corrugator box plants each day: to determine the least-cost method of combining customer orders on the corrugator, where one of the major costs to...

An important, recurring problem in statistics involves the determination of strata boundaries for use in stratified sampling. This paper describes a practical method for stratifying a population of observations based on optimal cluster analysis. The goal of stratification is constructing a...

The conventional approach to the assembly line balancing problem assumes that the manufacturing methods to be used have been predetermined. However, in practice the design engineer has several alternatives available in the choice of processing, typically involving a trade-off between labor or...

In this paper we consider a certain aggregate production planning model. This model permits regular and overtime production and allows for backordering of goods for a number of periods. Although the discussed model can be formulated as a linear programming problem a special (noniterative) method...

This paper considers the problem of maximizing the expected value of multicommodity flows in a network in which the arcs experience probabilistic loss rates. Consideration of probabilistic losses are relevant, particularly, in communication and transportation networks. An arc-chain formulation...

In dynamic facility location problems, one desires to select the time-staged establishment of facilities at different locations so as to minimize the total discounted costs for meeting demands specified over time at various customer locations. We formulate a particular dynamic facility location...

We develop in this paper two types of heuristic methods for solving the positive 0-1 polynomial programming (PP) problem of finding a 0-1 vector x that maximizes c^Tx subject to f(x) \le b where c, b \ge 0 and f is an m-vector of polynomials with non-negative coefficients. The various heuristics...

A specially-structured integer programming model, called the multiple-choice nested knapsack model, is developed in this paper. The model is characterized by variables which are partitioned into multiple-choice sets and resource constraints which are nested across the multiple-choice sets. The...