.png){kind=icon}
返回
A fast tabu search algorithm for the permutation flow-shop problem
.png){kind=icon}
PRE
AI
DOI：10.1016/0377-2217(95)00037-2.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A fast and easily implementable approximation algorithm for the problem of finding a minimum makespan in the permutation Row shop is presented. The algorithm is based on a tabu search technique with a specific neighborhood definition which employs a block of jobs notion. Computational experiments (up to 500 jobs and 20 machines) show its excellent numerical properties.
Keyword:
flow-shop scheduling
heuristics
tabu search
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
Trophic transfer of essential elements in the clownfish Amphiprion ocellaris in the context of ocean acidification.png)
PLOS ONE
OAAI
PLOS ONEIF0
OAAI分享收藏Adsorption of Cu(II), Pb(II), and Cd(II) Ions from Acidic Aqueous Solutions by Diethylenetriaminepentaacetic Acid-Modified Magnetic Graphene Oxide二乙烯三胺五乙酸改性的磁性氧化石墨烯对酸性水溶液中Cu(II)，Pb(II) 和Cd(II) 离子的吸附
PREAI
分享收藏
查看更多内容