Multiple-part cyclic hoist scheduling using a sieve method

The paper proposes an algorithm for generating optimal cyclic schedules of hoist moves in a printed circuit board electroplating facility where transp ortation of parts between workstations is performed by a computer-controlle d hoist. The objective of the scheduling problem is to maximize the through put rate. Unlike many previous algorithms which consider 1-part cyclic sche dules, the proposed algorithm provides an exact solution for the more compl icated case of 1-part cyclic schedules where r > 1, The algorithm is illust rated with numerical examples comparing 1-part and multiple-part optimal sc hedules.