On scheduling parallel machines with two setup classes

We examine I he problem of scheduling jobs at a bank of parallel identical machines where each job requires either a major or a minor setup depending on the job that was processed immediately before it. Several heuristic procedures are proposed and tested with respect to makespan, average flowtime and time spent on setups.