This paper introduces an efficient branch and bound algorithm for a special class of mixed integer programming problems called the warehouse location problem. A set of branching decision rules is proposed for selecting warehouses to be constrained open and closed from any node of the branch and...

This paper describes an efficient solution procedure for the warehouse location problem in which limitations on the amount of goods which can be handled are also imposed. The proposed branch-and-bound solution method is made efficient by developing dominance, lower and upper bounding procedures...

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...

The multi-asset investment renewal problem is characterized by two types of costs: transaction costs incurred when any renewal takes place at a point in time, and investment costs which are associated with renewing individual assets. A discrete-time version of this renewal scheduling problem is...

The planning of production, inventories, and work force at an aggregate level to respond to fluctuating demands on a production system has received substantial theoretical treatment in the literature for several years. However, widespread implementation of the available analytical techniques has...

This note questions the authors' claim for optimality in designing cusum charts using the heuristic pattern search method.