.png){kind=icon}
返回
Constraint-directed techniques for scheduling alternative activities
.png){kind=icon}
OA
AI
DOI：10.1016/S0004-3702(00)00035-7.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we expand the scope of constraint-directed scheduling techniques to deal with the case where the scheduling problem includes alternative activities. That is, not only does the scheduling problem consist of determining when an activity is to execute, but also determining which set of alternative activities is to execute at all. Such problems encompass both alternative resource problems and alternative process plan problems. We formulate a constraint-based representation of alternative activities to model problems containing such choices. We then extend existing constraint-directed scheduling heuristic commitment techniques and propagators to reason directly about the fact that an activity does not necessarily have to exist in a final schedule. Experimental results show that an algorithm using a novel texture-based heuristic commitment technique together with extended edge-finding propagators achieves the best overall performance of the techniques tested. (C) 2000 Elsevier Science B.V. All rights reserved.
Keyword:
scheduling
heuristic search
constraints
problem structure
alternative activities
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
13.9
论文数:
6.1K
被引数:
1.9W
机构
暂无机构信息
引用论文
Variable and value ordering heuristics for the job shop scheduling constraint satisfaction problem
.png){kind=icon}
PREAI
分享收藏分享收藏Effect of Sintering Atmosphere on Isolated Pores During the Liquid‐Phase Sintering of MgO‐CaMgSiO4
PREAI
分享收藏 没有更多内容
没有更多内容