Abstract
We consider the problem of sequencing a set of changeover dependent jobs in a parallel processor shop subject to a workload restriction where the objective is to achieve minimum total changeover cost. A heuristic algorithm, developed previously to treat the vehicle delivery model, is used on the problem. Suitable computational experience with the algorithm is provided the results of which would support its application to problems of realistic size.