A Variable Neighborhood Migrating Birds Optimization Algorithm for Flexible Job Shop Scheduling.

A hybrid meta-heuristic named variable neighborhood migrating birds optimization (VNMBO), which is a combination of variable neighborhood search (VNS) and migrating birds optimization (MBO). The main aim of this paper is to provide a new way for MBO to solve the flexible job shop scheduling problem (FJSP). A two-stage population initialization scheme was first adopted to improve the quality of the initial solutions. An individual leaping mechanism was introduced to the algorithm in order to avoid the premature convergence. To search the solution space effectively, three neighborhood structures were designed and a VNS was developed to enhance the local searching ability. Finally, to assess the performance of the proposed VNMBO, some published algorithms were compared by using two famous benchmark data sets. The comparison results show that the proposed VNMBO is effective for solving the FJSP with the objective of minimizing the makespan. [ABSTRACT FROM AUTHOR]

Copyright of International Journal of Performability Engineering is the property of Totem Publisher, Inc. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)