A shuffled frog-leaping algorithm for flexible job shop scheduling with the consideration of energy consumption
A shuffled frog-leaping algorithm for flexible job shop scheduling with the consideration of energy consumption
复制标题
考虑能耗的混合蛙跳算法柔性车间调度
DOI：
10.1080/00207543.2016.1262082
复制
发表时间：
2017-01-01
影响因子：
9.2
通讯作者：
Guo, Xiuping
中科院分区：
文献类型：
--
作者：
Lei, Deming;Zheng, Youlian;Guo, Xiuping
柔性作业车间调度问题（FJSP）已经得到了广泛的研究，其目标通常与时间有关。随着绿色制造的出现，FJSP应充分考虑与能源有关的目标。在本研究中，考虑了最小化工作负载平衡和总能耗的FJSP，并分析了两个目标之间的冲突。提出了一种基于三串编码方法的洗刷蛙跳算法（SFLA）。利用种群和非劣势集根据竞赛选择构造模群，并对每个模群的非劣势成员进行搜索。通过大量的实验来测试SFLA的搜索性能，计算结果表明了FJSP的两个目标之间的冲突以及SFLA在考虑的FJSP上的潜在优势。
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.