CYCLICAL JOB SEQUENCING ON MULTIPLE SETS OF IDENTICAL MACHINES.

The problem posed in this paper is to sequence or route n jobs, each originating at a particular location or machine, undergoing r-1 operations or repairs, and terminating at the location or machine from which it originated. The problem is formulated as a 0-1 integer program, with block diagonal structure, comprised of r assignment subproblems; and a joint set of constraints to insure cyclical sequences. To obtain integer results the solutions to each subproblem are ranked as required and combinations thereof are implicitly enumerated. The procedure may be terminated at any step to obtain an approximate solution. Some limited computational results are presented.