A competitive memetic algorithm for the distributed two-stage assembly flow-shop scheduling problem

作者：Deng, Jin; Wang, Ling^*; Wang, Sheng-yao; Zheng, Xiao-long

来源：International Journal of Production Research, 2016, 54(12): 3561-3577.

DOI：10.1080/00207543.2015.1084063

• distributed two-stage assembly flow-shop scheduling
• memetic algorithm
• makespan

This article addresses the distributed two-stage assembly flow-shop scheduling problem (DTSAFSP) with makespan minimisation criterion. A mixed integer linear programming model is presented, and a competitive memetic algorithm (CMA) is proposed. When designing the CMA, a simple encoding scheme is proposed to represent the factory assignment and the job processing sequence; and a ring-based neighbourhood structure is designed for competition and information sharing. Moreover, some knowledge-based local search operators are developed to enhance the exploitation ability. The influence of parameter setting on the CMA is investigated using the analysis of variance method. Extensive computational tests and comparisons are carried out, which demonstrate the effectiveness of the proposed CMA in solving the DTSAFSP.

• 出版日期2016
• 单位清华大学