.png){kind=icon}
返回
Comparing meta-heuristic approaches for parallel machine scheduling problems
.png){kind=icon}
PRE
AI
DOI：10.1080/09537280110069649.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The aim of this paper is to compare the performance of two meta-heuristic methods proposed to solve the identical parallel machine scheduling problem with sequence dependent setup times. The goal is to minimize the makespan. The first algorithm is a tabu search based heuristic and the second a memetic approach, which combines a population-based method with local search procedures. As benchmarks for small-sized instances, optimal and lower bound values are used provided by a dichotomous search. For larger instances, the comparisons rely on the best known solutions provided by an exhaustive search variant of the tabu procedure.
Keyword:
machine scheduling
parallel machines
meta-heuristics
tabu search
memetic algorithms
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
P
IF:
5.4
论文数:
2.6K
被引数:
8.1K
机构
暂无机构信息
引用论文
.png){kind=icon}
A tabu search heuristic for the multiprocessor scheduling problem with sequence dependent setup times具有序列相关设置时间的多处理器调度问题的禁忌搜索启发式方法
PREAI
分享收藏
没有更多内容
没有更多内容