Two agent stochastic flow shop deteriorating scheduling via a hybrid multi objective evolutionary algorithm
Multi agent and deteriorating scheduling has gained an increasing concern from academic and industrial communities in recent years. This study addresses a two agent stochastic flow shop deteriorating scheduling problem with the objectives of minimizing the makespan of the first agent and the total tardiness of the second agent. In the investigated problem, the normal processing time of jobs is a random variable, and the actual processing time of jobs is a linear function of their normal processing time and starting time. To solve this problem efficiently, this study proposes a hybrid multi objective evolutionary algorithm which is a combination of an evolutionary algorithm and a local search method. It maintains two populations and one archive. The two populations are utilized to execute the global and local searches, where one population employs an evolutionary algorithm to explore the whole solution space, and the other applies a local search method to exploit the promising regions. The archive is used to guide the computation resource allocation in the search process. Some special techniques, i.e. evolutionary methods, local search methods and information exchange strategies between two populations, are designed to enhance the exploration and exploitation ability. Comparing with the classical and popular multi objective evolutionary algorithms on some test instances, the experimental results show that the proposed algorithm can produce satisfactory solution for the investigated problem.
J. Intell. Manuf.