An efficient algorithm for multi-hoist cyclic scheduling with fixed processing times

We consider no-wait production processes, where identical products are processed sequentially on n   machines and transported by programmable hoists. We present an O(n5)O(n5) algorithm that determines the minimum number of hoists required for all possible cycle-times; given the number of hoists, it also finds the minimum-time cyclic hoist-schedule.