MILP scheduling model for multipurpose batch processes considering various intermediate storage policies |
| |
Authors: | Ho-Kyung Lee Sang Beom Kim Euy Soo Lee In-Beum Lee |
| |
Affiliation: | (1) Dept. of Chemical Engineering, POSTECH, 790-784 Pohang, Korea;(2) Samsung SDS Co., Ltd., World Tower, 7-25, Shinchun-Dong, Songpa-Gu, 138-240 Seoul, Korea;(3) Dept. of Chemical Engineering, Dongguk University, 100-715 Seoul, Korea |
| |
Abstract: | MILP (Mixed Integer Linear Programming) scheduling models for non-sequential multipurpose batch processes are presented. Operation sequences of products have to be made in each unit differently by considering production route of each product under a given intermediate storage policy to reduce idle time of units and to raise the efficiency of the process. We represent the starting and finishing time of a task in each unit with two coordinates for a given storage policy. One is based on products, and the other is based on operation sequences. Then, using binary variables and logical constraints, we match the variables used in the two coordinates into one. We suggest MILP models considering sequence dependent setup times to guarantee the optimality of the solutions. Two examples are presented to show the effectiveness of the suggested models. |
| |
Keywords: | MILP Model Scheduling Non-Sequential Multipurpose Process Intermediate Storage Policy |
本文献已被 SpringerLink 等数据库收录! |
|