AbstractThe problem posed in this paper is to sequence or routenjobs, each originating at a particular location or machine, undergoingr−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 ofrassignment subproblems; and a joint set of constraints to insure cyclical squences. 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 presen