Application of Cultural Algorithms to Earliness/Tardiness Flow Shop With Uncertain Processing Time

Earliness/Tardiness flow shop with determinate processing time has been tackled by a variety of traditional optimization techniques over the years. In reality, however, processing time is often imprecise while it is critical for the scheduling problem. In this paper, an optimization model with uncertain parameters has been established by employing interval numbers based on possibility degree method to represent uncertain processing time. Then an effective cultural algorithm is proposed to solve the optimal problem. The belief space is specified in terms of traits of scheduling problem. The simulation results suggest the rapid convergence speed.