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

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

0.00 Avg rating—0 Votes
Article ID: iaor2007674
Country: Netherlands
Volume: 34
Issue: 4
Start Page Number: 465
End Page Number: 472
Publication Date: Jul 2006
Journal: Operations Research Letters
Authors: ,
Abstract:

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) 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.

Reviews

Required fields are marked *. Your email address will not be published.