An extension of Palmer's heuristic for the flow shop scheduling problem

Abstract

We describe a simple modification of Palmer's heuristic for scheduling jobs in a flow shop. While the additional computation required is relatively small, the performance of the algorithm compares very well with that of the more sophisticated and better algorithm of Campbell, et al. (1970) at a fraction of the effort required by the latter.