IEEE Trans Cybern. 2023 Jun;53(6):3818-3828. doi: 10.1109/TCYB.2022.3164165. Epub 2023 May 17.
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.
考虑完成时间和总能耗的分布式流水车间分批排序问题。该问题需要将作业最优地分配到多个分布式工厂，并对其进行排序。首先，开发了一个双目标数学模型来描述所考虑的问题。然后，提出了一种改进的 Jaya 算法来解决它。根据问题的特点，设计了 Nawaz-Enscore-Ham（NEH）初始化规则、作业-工厂分配策略、改进的最大完工时间和能源效率策略，以提高 Jaya 的性能。最后，在 12 个规模的 120 个实例上进行了实验。验证了改进策略的性能。比较和讨论表明，所设计策略改进的 Jaya 算法在解决最大完工时间和总能耗标准的考虑问题方面具有很强的竞争力。
