A biogeography-based optimization algorithm with modified migration operator for large-scale distributed scheduling with transportation time

Abstract

To expand production scale and enhance enterprise competitiveness, modern supply chains and manufacturing systems have shifted from the single factory production to the multi-factory production network with the characteristics of large scale, diversification of varieties, redundant production factories, flexible production processes, and high-value products. This production mode is called distributed scheduling. The transportation time caused by geographically distributed factories in Distributed Scheduling Problem (DSP) with a series-parallel network plays an important role in the scheduling scheme. To minimize the global makespan over all factories, a two-segment representation has been taken as an encoding scheme while the decoding procedure applies the First Come First Served (FCFS) heuristic rule. A Biogeography-Based Optimization with Modified Migration Operator (BBO-MMO) is then proposed to address the heterogeneous DSP with transportation time between factories at adjacent processing stages, which improves the migration operator by modifying the immigration rate according to processing time and transportation time. A cosine migration model has been adopted to enhance the ability of BBO-MMO to break through local optimum. BBO-MMO is compared with the Improved Memetic Algorithm (IMA), and several groups of examples with various parameters have been generated to test the performance of BBO-MMO. The results show that the proposed BBO-MMO can effectively solve the large-scale heterogeneous DSP with transportation time.