Reducing manufacturing lead times and minimizing work-in-process (WIP) inventories are the cornerstones of popular manufacturing strategies such as Lean, Quick Response, and Just-in-Time Manufacturing. In this paper, we present a model that captures the relationshipbetween facility layout and...

Since procedures for producing optimal solutions to a quadratic assignment problem are computationally infeasible for any but small problems, heuristic techniques for producing approximate solutions must be employed for the solution of real practical problems. This paper presents the results of...

This paper describes a branch and bound approach for optimizing a media selection problem, namely, to choose the best set of mailing lists to maximize audience reach. Prompted by a national retailer's interest in more effective and efficient direct mail catalogue distribution, the algorithm...

Many algorithms have been developed for the optimal solution of the asymmetric travelling salesman problem: the most efficient ones are based on the subtour elimination approach. This paper presents a breadth-first branch and bound algorithm which differs from the method of Smith, Srinivasan and...

Numerous methods have been proposed for solution of the simple assembly line balancing (SALB) problem. This paper describes a branch and bound algorithm which in many cases is faster than the well-known Hoffmann heuristic technique to which it is related. It introduces a simple bounding rule...

Recent approaches to modeling the client's payment-scheduling problem allow the client to control both the timing of payments and the completion times of activities. In practice, the activity schedule is typically determined by the contractor rather than the client. This paper addresses this...

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

Erratum to Carpaneto, Giorgio, Paolo Toth. 1980. Branching and bounding criteria for the asymmetric travelling salesman problem. Management Sci. 26 (7) 736--743.

In this paper we present a heuristic method, based on Lagrangian relaxation, for multilevel lot-sizing when there is a single bottleneck facility. A series of Lagrangian relaxations (one for each item in the product structure) is imbedded in a branch and bound procedure. The objective is to find...

In this note, a node elimination procedure has been suggested in case the two sequences obtained by using Townsend's (Townsend, W. 1978. The single machine problem with quadratic penalty function of completion times: A branch and bound solution. Management Sci. 24 (5) 530--534.) sufficient...