Discrete differential evolution algorithm for distributed blocking flowshop scheduling with makespan criterion

摘要

This paper deals with a distributed blocking flowshop scheduling problem, which tries to solve the blocking flowshop scheduling in distributed manufacturing environment. The optimization objective is to find a suitable schedule, consisting of assigning jobs to at least two factories and sequencing the jobs assigned to each factory, to make the maximum completion time or makespan minimization. Two different mathematical models are proposed, and in view of the NP-hardness of the problem, a novel hybrid discrete differential evolution (DDE) algorithm is established. First, the problem solution is represented as several job permutations, each of which denotes the partial schedule at a certain factory. Second, four widely applied heuristics are generalized to the distributed environment for providing better initial solutions. Third, both operators of mutation and crossover are redesigned to perform the DDE directly based on the discrete permutations, and a biased section operator is used to increase the diversity of the searching information. Meanwhile, an effective local search based on distributed characteristics and an elitist retain strategy are integrated into the DDE framework to stress both local exploitation and global exploration. Taking into account the time cost, an effective speed-up technique is designed to enhance the algorithmic efficiency. In the experimental section, the parameters of DDE are calibrated by the Taguchi method. Experimental results derived from a wealth of test instances have demonstrated the algorithmic effectiveness, which further concludes that the proposed DDE algorithm is a suitable alternative approach for solving the problem under consideration.