Scheduling parallel processors to minimize setup time

Abstract

The problem of scheduling parallel processors in a make-to-stock environment with sequencedependent setup costs is considered. A new algorithm which formulates a series of 0 1 integer subproblems is proposed and contrasted with an earlier formulation. Parallels between the subproblem formulations and generalized networks are discussed.