A Grouped Fruit-Fly Optimization Algorithm for the No-Wait Lot Streaming Flow Shop Scheduling

摘要

Lot streaming involves splitting products into several sublots to enhance the processing flexibility. In this paper the no-wait lot streaming flow shop scheduling problem is discussed with the constraint of unintermingling consistent-size sublots. The number of sublots, sublots sizes and the sequence of products are optimized by a proposed grouped fruit fly optimization algorithm (GFOA). We design three basic neighborhood structures and a structure based on the no-wait property to generate new solutions. A speed-up evaluation method is presented to improve the efficiency. Numerical test results and comparisons are provided, which demonstrate the effectiveness of the proposed GFOA.