.png){kind=icon}
返回
GPU based parallel genetic algorithm for solving an energy efficient dynamic flexible flow shop scheduling problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.jpdc.2018.07.022.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Due to new government legislation, customers' environmental concerns and continuously rising cost of energy, energy efficiency is becoming an essential parameter of industrial manufacturing processes in recent years. Most efforts considering energy issues in scheduling problems have focused on static scheduling. But in fact, scheduling problems are dynamic in the real world with uncertain new arrival jobs after the execution time. This paper proposes an energy efficient dynamic flexible flow shop scheduling model using the peak power value with consideration of new arrival jobs. As the problem is strongly NP-hard, a priority based hybrid parallel Genetic Algorithm with a predictive reactive complete rescheduling strategy is developed. In order to achieve a speedup to meet the short response in the dynamic environment, the proposed method is designed to be highly consistent with the NVIDIA CUDA software model. Finally, numerical experiments are conducted and show that our approach can not only solve the problem flexibly, but also gain competitive results and reduce time requirements dramatically. (C) 2018 Elsevier Inc. All rights reserved.
Keyword:
Flexible flow shop
Energy efficiency
Dynamic scheduling
Hybrid parallel genetic algorithm
GPU Computing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
引用论文
.png){kind=icon}
An investigation into minimising total energy consumption and total weighted tardiness in job shopsOAAI
OAAI分享收藏
Electrochemical synthesis of phosphorus-doped graphene quantum dots for free radical scavenging电化学合成磷掺杂石墨烯量子点及其自由基清除性能
PREAI
分享收藏分享收藏
查看更多内容