.png){kind=icon}
返回
Parallel machine scheduling with splitting jobs by a hybrid differential evolution algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2012.12.007.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The problem of parallel machine scheduling for minimizing the makespan is an open scheduling problem with extensive practical relevance. It has been proved to be non-deterministic polynomial hard. Considering a job's batch size greater than one in the real manufacturing environment, this paper investigates into the parallel machine scheduling with splitting jobs. Differential evolution is employed as a solution approach due to its distinctive feature, and a new crossover method and a new mutation method are brought forward in the global search procedure, according to the job splitting constraint. A specific local search method is further designed to gain a better performance, based on the analytical result from the single product problem. Numerical experiments on the performance of the proposed hybrid DE on parallel machine scheduling problems with splitting jobs covering identical and unrelated machine kinds and a realistic problem are performed, and the results indicate that the algorithm is feasible and efficient. (C) 2012 Elsevier Ltd. All rights reserved.
Keyword:
Parallel machine scheduling
Job splitting
Differential evolution
Local search
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems一种求解阻塞流水车间调度问题的混合离散差分进化算法
PREAI
分享收藏A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property具有作业拆分特性的相同并行机调度问题的分支定界算法
PREAI
分享收藏分享收藏
查看更多内容