.png){kind=icon}
返回
Batch selection, assignment and sequencing in multi-stage multi-product processes
.png){kind=icon}
PRE
AI
DOI：10.1016/j.compchemeng.2007.06.012.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The scheduling of multi-product, multi-stage batch processes is industrially important because it allows us to utilize resources that are shared among competing products in an optimal manner. Previously proposed methods consider problems where the number and size of batches is known a priori. In many instances, however, the selection and sizing (batching) of batches is or should be an optimization decision. To address this class of problems we develop a novel mixed-integer linear programming (MILP) formulation that involves three levels of discrete decisions: selection of batches, assignment of batches to units and sequencing of batches in each unit. Continuous decision variables include sizing and timing of batches. We consider various objective functions: minimization of makespan, earliness, lateness and production cost, as well as maximization of profit, an objective not addressed by previous multi-stage scheduling methods. To enhance the solution of the proposed MILP model we propose symmetry breaking constraints, develop a preprocessing algorithm for the generation of constraints that reduce the number of feasible solutions, and fix sequencing variables based upon time window information. The model enables the optimization of batch selection, assignment and sequencing decisions simultaneously and is shown to yield solutions that are better than those obtained by existing sequential optimization methods. (C) 2007 Elsevier Ltd. All rights reserved.
Keyword:
scheduling
mixed-integer programming
multi-stage multi-product batch processes
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
3.9
论文数:
8.1K
被引数:
1.7W
机构
引用论文
.png){kind=icon}
分享收藏A slot-based formulation for single-stage multiproduct batch plants with multiple orders per product
PREAI
分享收藏
查看更多内容