A Composite Heuristic Algorithm for the Flowshop Scheduling Problem with Limited Buffer
Abstract：A new composite heuristics algorithm was presented for solving the limited buffers flow shop scheduling problems with objectives of minimizing the makespan. In this algorithm,PF-NEH algo- rithm was first utilized for evolutionary exploration among the solution space, and a variable neighbor- hood search algorithm based on insert neighborhood and swap neighborhood was also applied to improve the local search. Computational results showed the effectiveness and superiority of the proposed algo- rithm.
Keywords：flowshop scheduling problem with limited bufferPF-NEH heuristic algorithmvariable neighborhood search algorithm
Publication Date：2012-01-01
Online Publishing Date：2026-08-28(First online date of this platform, not the publication date of the document)
Pages：8( 66-73 )