.png){kind=icon}
.png){kind=icon}
返回
Search tree based approaches for parallel machine scheduling
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2006.07.008.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This article compares two branching schemes for the parallel machine scheduling problem with release dates and tails. Both branching schemes can be used for either complete or incomplete search tree based algorithms. In particular, our study aims to prove the robustness of each of them for several search methods. We experimentally compare the efficiency of the two branching schemes when they are used in a branch-and-bound (BnB) method, in a limited discrepancy search, in a branch-and-greed (BnG) method or in a beam search (BS). (C) 2006 Elsevier Ltd. All rights reserved.
Keyword:
parallel machine scheduling
makespan
release dates
tails
search tree
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。