Dynamic scheduling of multi-task for hybrid flow-shop based on idle time windows

This paper presents an approach based on idle time windows (ITWs) and particle swarm optimization (PSO) algorithm to solve dynamic scheduling of multi-task for hybrid flow-shop. The idea of ITW is introduced, then the dynamic updating rules of the sets of ITWs are explained in detail. With the sets of ITWs of machines as constraints, the mathematical model is presented for dynamic scheduling of multi-task for hybrid flow-shop. The PSO algorithm is proposed in order to solve this problem. The results of simulation indicate that this approach satisfies the demand of dynamic scheduling of multi-task.