返回
Scheduling multi-purpose batch plants with junction constraints
DOI:10.1080/00207549608904917.png)
摘要
En 中文
There is an increasing trend in the chemical process industry to operate flexible batch plants because of their capability to manufacture multiple products simultaneously by sharing the same process resources. In this paper, the scheduling of multi-purpose batch chemical plants with junction (header) constraints is considered. A mixed-integer non-linear model for the scheduling of multi-purpose batch chemical plants is formulated that considers the connection between equipment sets, transfer times, variable batch sizes, alternative process plans, and batch merging. Because of the computational time complexity of the batch scheduling problem, a heuristic scheduling algorithm that minimizes the total tardiness is developed to solve the model.
Keyword:
CHEMICAL-PLANTS
MULTIPRODUCT
OPTIMIZATION
FORMULATION
ALGORITHMS
OPERATIONS
PENALTIES
DESIGN
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.3
论文数:
1.1W
被引数:
3.7W
机构
暂无机构信息

