|
Abstract
|
In this paper, a new algorithm with complexity O(nm2) is presented, which finds the optimal makespan, Cmax, for a blocking flow-shop problem by slowing down the operations of a no-wait floe-shop problem, Fm|no-wait| Cmax,for a given sequence where restriction on the slowing down is committed. However, the problem with performance measure makespan, Cmax in a non-cyclic environment, is a special case of cyclic problem with cycle time, Ct, as its performance measure. This new algorithm is much faster than the previously developed algorithms for cyclical scheduling problems.
|