An Enhanced Migrating Birds Optimization for the Flexible Job Shop Scheduling Problem with Lot Streaming

摘要

This paper presents an enhanced migrating birds optimization (enMBO) for the flexible job shop scheduling problem with the consideration of lot streaming and the goal is minimizing total flowtime. In enMBO, to explore the solution space efficiently, we design a search scheme which is capable of adjusting the search radius with the increase of iteration. In addition, MBO concentrates too much on local search and hence is easily trapped in local optimum. To handle this, a special mechanism that based on precedence operation crossover is developed and incorporated into the evolutionary framework. We conduct simulations on well-known benchmarks with different scales and results verify the significance of schemes designed above. Moreover, by comparing with recent algorithms, the proposed enMBO shows its high performance for the considered problem.