Solution of the generalized Townsend single machine scheduling model

The paper deals with the generalized version of Townsend's n-job single machine scheduling model. It shows that the model is highly decomposable for n=20, 50 and 100 when all its parameters are drawn from the same uniform distribution. It identifies a less decomposable version and provides an improved branching method to solve it. This method is tested on problems of size n=20 and 50 on a PC and n=100 on a mainframe computer.