A Bottleneck Degree-Based Migrating Birds Optimization Algorithm for the PCB Production Scheduling

Abstract

To address the printed circuit board shop scheduling problem, a dynamic based on multiindicator bottleneck degree is proposed to formulate this complex flexible job shop scheduling problem (FJSP). Then, a bottleneck degree-based migrating birds optimization algorithm (MBO) is proposed to tackle this NP-hard problem. Specifically, a multi-indicator assessment model is first developed to obtain the bottleneck degree, and then a two-layer code-decoding structure based on the variable domain structure and the addition of the improved migratory bird algorithm with competitive mechanisms are employed to improve the effectiveness. Finally, the computational experiments demonstrate that the proposed dynamic scheduling approach based on bottleneck degrees and improved migrating bird algorithms can obtain promising results and it outperforms several other algorithms.

Review of Nature Inspired Metaheuristic Algorithm Selection for Combinatorial t-Way Testing

“…MBO mimics the natural mechanism of V-flight shape of migrating birds. The MBO works frequently in areas dealing with scheduling optimization problems including [100] for production, [101], [102] for flow shop. Moreover, we discovered that MBO is recently accepted in t-way testing such as [103], [104] for combinatorial explosion problem.…”