Efficient Solution Procedures for Certain Scheduling and Sequencing Problems

Abstract

The solution of scheduling and sequencing problems has in most cases proved to involve serious difficulties. Direct solution methods are available only for problems of very special structure — e.g., see [7] — and computational experience with recursive procedures has generally been quite disappointing. Dynmaic programming has been of very limited utility (e.g., see [4] and the comments of [8] on [2]). Branch and bound methods, although frequently proposed (e.g., see [1] and [6]), have generally not been efficient enough to provide a practical solution procedure.