.png){kind=icon}
返回
A Pattern Matching Method for Large-Scale Multipurpose Process Scheduling
.png){kind=icon}
PRE
AI
DOI：10.1002/aic.12302.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This article proposes a novel pattern matching method for the large-scale multipurpose process scheduling with variable or constant processing times. For the commonly used mathematical programming models, large-scale scheduling with long-time horizons implies a large number of binary variables and time sequence constraints, which makes the models intractable. Hence, decomposition and cyclic scheduling are often applied to such scheduling. In this work, a long-time horizon of scheduling is divided into two phases. Phase one is duplicated from a pattern schedule constructed according to the principle that crucial units work continuously, in parallel and/or with full load as possible, exclusive of time-consuming optimization. Phase two involves a small-size subproblem that can be optimized easily by a heuristic method. The computational effort of the proposed method does not increase with the problem size. The pattern schedule can be not only used for production/profit maximization but also for makespan estimation and minimization. (C) 2010 American Institute of Chemical Engineers AIChE J, 57: 671-694, 2011
Keyword:
pattern matching
scheduling
multipurpose batch plants
decomposition
heuristic
search tree
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
1.1W
被引数:
2.9W
机构
引用论文
.png){kind=icon}
分享收藏
分享收藏分享收藏分享收藏
查看更多内容