On the combinatorial structure of discrete-time MIP formulations for chemical production scheduling

详细信息	查看全文 | 推荐本文 |

• 作者：Christos T. Maravelias ; ^{maravelias@wisc.edu}
• 关键词：Combinatorial optimization ; Dynamic network ; Time-expanded network ; Vertex packing ; Fixed-charge network
• 刊名：Computers and Chemical Engineering
• 出版年：2012
• 期刊代码：35_00981354
• 类别：et
• 出版时间：5 March, 2012
• 卷：38
• 期：Complete
• 页码：204-212
• 文件大小：1365 K

摘要

We study the structure of discrete-time mixed-integer programming (MIP) models for chemical production scheduling. We discuss how chemical manufacturing facilities can be represented as dynamic networks and then converted into time-expanded networks with side constraints. Based on this representation, we show that material balance constraints of the MIP models correspond to generalized flow balances in time-expanded networks. We discuss the implications of conversion coefficients in tasks with multiple inputs and outputs. We also show that assignment constraints lead to side constraints that are equivalent to clique constraints in the time-expanded task-graph of the facility. Finally, we discuss how variable batchsizes lead to fixed charge network structures.