Solving Biobjective Distributed Flow-Shop Scheduling Problems With Lot-Streaming Using an Improved Jaya Algorithm
Yuxia Pan, Kaizhou Gao, Zhiwu Li, Naiqi Wu
Abstract
A distributed flow-shop scheduling problem with lot-streaming that considers completion time and total energy consumption is addressed. It requires to optimally assign jobs to multiple distributed factories and, at the same time, sequence them. A biobjective mathematic model is first developed to describe the considered problem. Then, an improved Jaya algorithm is proposed to solve it. The Nawaz-Enscore-Ham (NEH) initializing rule, a job-factory assignment strategy, the improved strategies for makespan and energy efficiency are designed based on the problem's characteristic to improve the Jaya's performance. Finally, experiments are carried out on 120 instances of 12 scales. The performance of the improved strategies is verified. Comparisons and discussions show that the Jaya algorithm improved by the designed strategies is highly competitive for solving the considered problem with makespan and total energy consumption criteria.