.png){kind=icon}
返回
Reactive scheduling framework based on domain knowledge and constraint programming
.png){kind=icon}
OA
AI
DOI：10.1016/j.compchemeng.2010.07.011.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Industrial environments frequently face disruptive events. This contribution presents a support framework, aimed at addressing the repair-based reactive scheduling problem. It is based on an explicit object-oriented domain representation and a constraint programming (CP) approach. When an unforeseen event occurs, the framework captures the in-progress agenda status, as well as the event effect on it. Based on this information, a rescheduling problem specification is developed. Tasks to be rearranged are recognized and the set of the most suitable rescheduling action types (e.g. shift-jump, reassign, freeze) is identified. Since a given specification may lead to several solutions, the second stage relies on a CP model to address the problem just defined. To create such model, action types are automatically transformed into constraints. Provided that good quality schedules can be reached in low CPU times, alternative solution scenarios focusing on stability and regular performance measures can be posed for each problem. (C) 2010 Elsevier Ltd. All rights reserved.
Keyword:
Reactive scheduling
Batch plants
Decision support systems
Knowledge-based scheduling
Constraint programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
3.9
论文数:
8.1K
被引数:
1.7W
机构
引用论文
.png){kind=icon}
查看更多内容