.png){kind=icon}
返回
Criteria-directed task scheduling
.png){kind=icon}
PRE
AI
DOI：10.1016/S0888-613X(98)10006-3.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Scheduling complex problem solving tasks, where tasks are interrelated and there are multiple different ways to go about achieving a particular task, is an imprecise science and the justification for this lies soundly in the combinatorics of the scheduling problem. Intractable problems require specialized solutions, perhaps even a cadre of different specialized techniques. We have developed a new domain-independent approach to task scheduling called Design-to-Criteria that controls the combinatorics via a satisficing methodology and custom designs, schedules to meet a particular client's goal criteria. In Design-to-Criteria, criteria directed focusing, approximation, and heuristics, in conjunction with soft goal criteria are used to make the scheduling problem tractable. We describe the interesting facets of the Design-to-Criteria approach and give examples of its power at reducing the complexity of the scheduling task while designing custom satisficing schedules. (C) 1998 Elsevier Science Inc. All rights reserved.
Keyword:
real-time
task scheduling
heuristic
approximate
satisficing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3
论文数:
3.0K
被引数:
5.1K
机构
暂无机构信息
.png){kind=icon}
