.png){kind=icon}
返回
A General Framework for Process Scheduling
.png){kind=icon}
OA
AI
DOI：10.1002/aic.12300.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Existing methods for process scheduling can be broadly classified as network-based or sequential. The former are used to address problems where different batches of the same or different tasks are freely mixed or split, whereas the latter are used to address problems where batch mixing/splitting is not allowed. A framework is proposed that allows us to: (1) express scheduling problems in facilities that consist of network and sequential, as well as continuous subsystems, (2) formulate mixed-integer programming (MIP) scheduling models for such problems, and (3) solve the resulting MIP formulations effectively. The proposed framework bridges the gap between network and sequential approaches, thereby addressing the major formulation challenge in the area of process scheduling, namely, the development of a framework that can be used to address a wide spectrum of problems. (C) 2010 American Institute of Chemical Engineers AIChE J, 57: 695-710, 2011
Keyword:
process scheduling
mixed-integer programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
1.1W
被引数:
2.9W
机构
引用论文
.png){kind=icon}
Batch selection, assignment and sequencing in multi-stage multi-product processes多阶段多产品过程中的批次选择、分配和排序
PREAI
分享收藏分享收藏分享收藏
查看更多内容