.png){kind=icon}
返回
Modeling and solving real-time scheduling problems by stochastic integer programming
.png){kind=icon}
PRE
AI
DOI：10.1016/j.compchemeng.2003.09.009.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This contribution deals with scheduling problems of flexible chemical batch processes with a special emphasis on their real-time character. This implies not only the need for sufficiently short response times, but in particular the burden of in-complete knowledge about the future. To solve such problems, the application of two-stage stochastic integer programming techniques on moving horizons is proposed. They reflect the need for immediately applicable decisions and the potential of later recourse actions to cope with realized uncertainties. In addition to the classical expected value objective, simple measures of risk can be included. Motivated by an example process, some essential modeling prerequisites are discussed. As an important first step, the master scheduling problem is studied and a number of master scheduling models are presented. Large mixed-integer linear problems arise, which are well-suited for a dual decomposition approach. Numerical experiments with a problem-specific solution algorithm demonstrate the applicability of the method to real-world problems. (C) 2003 Elsevier Ltd. All rights reserved.
Keyword:
batch scheduling
uncertainty
stochastic integer programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
3.9
论文数:
8.1K
被引数:
1.7W
机构
暂无机构信息
引用论文
A novel branch and bound algorithm for scheduling flowshop plants with uncertain processing times一种新颖的分支定界算法，用于调度具有不确定处理时间的flowshop工厂
PREAI
分享收藏分享收藏
分享收藏Issues in the use, design and evolution of process scheduling and planning systems.png)
ISA TRANSACTIONS
ISA TRANSACTIONSIF6.5
PREAI
分享收藏
查看更多内容