.png){kind=icon}
Return
A Pattern Matching Method for Large-Scale Multipurpose Process Scheduling
.png){kind=icon}
PRE
AI
DOI：10.1002/aic.12302.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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
Keywords:
pattern matching
scheduling
multipurpose batch plants
decomposition
heuristic
search tree
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4
Papers:
1.1W
Citations:
2.9W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSaveShareSaveShareSaveShareSaveShareSave
View more