A shuffled frog-leaping algorithm for flexible job shop scheduling with the consideration of energy consumption
研究了同时最小化工作负荷平衡和总能耗的柔性作业车间调度问题，提出一种基于三字符串编码的混合蛙跳算法，实验表明该算法在解决两个目标冲突时具有优势。
Flexible job shop scheduling problem (FJSP) has been extensively investigated and objectives are often related to time. Energy-related objective should be considered fully in FJSP with the advent of green manufacturing. In this study, FJSP with the minimisation of workload balance and total energy consumption is considered and the conflicting between two objectives is analysed. A shuffled frog-leaping algorithm (SFLA) is proposed based on a three-string coding approach. Population and a non-dominated set are used to construct memeplexes according to tournament selection and the search process of each memeplex is done on its non-dominated member. Extensive experiments are conducted to test the search performance of SFLA and computational results show the conflicting between two objectives of FJSP and the promising advantages of SFLA on the considered FJSP.