A new algorithm for minimizing makespan, Cmax, in blocking flow-shop problem through slowing down the operations

In this paper, a new algorithm with complexity O(nm(2)) is presented, which finds the optimal makespan, C-max, for a blocking flow-shop problem by slowing down the operations of a no-wait flow-shop problem, F-m vertical bar no-wait vertical bar C-max, for a given sequence where restriction on the slowing down is committed. However, the problem with performance measure makespan, C-max, in a non-cyclic environment, is a special case of cyclic problem with cycle time, C-t, as its performance measure. This new algorithm is much faster than the previously developed algorithms for cyclical scheduling problems.