Please use this identifier to cite or link to this item:
Title: Unit slots based short-term scheduling for multipurpose batch plants
Authors: Susarla, N.
Li, J. 
Karimi, I.A. 
Keywords: MILP
Multipurpose batch plants
Slot based formulations
Unit slots
Issue Date: 2009
Source: Susarla, N.,Li, J.,Karimi, I.A. (2009). Unit slots based short-term scheduling for multipurpose batch plants. Computer Aided Chemical Engineering 27 (C) : 1989-1994. ScholarBank@NUS Repository.
Abstract: In chemical process industries, scheduling of multipurpose batch plants is challenging and has received tremendous attention so far. Recently, Susarla et al. (2009) explored the concept of unit- (asynchronized) slots for scheduling multipurpose batch processes and successfully reduced number of slots required for the optimal solution of a given problem. In this paper, we extend the work of Susarla et al. (2009) and utilize unit-slots to formulate a continuous-time mixed integer linear programming (MILP) model for the short-term scheduling of multipurpose batch processes. In addition to Susarla et al. (2009), our model is capable of handling various utility resources (other than the processing units and material resources) and sequence dependent changeover/setup times. Also, our model is capable of handling various storage configurations explicitly (Classes: UIS, LIS, and FIS with policies: UW, LW, and NW, Liu & Karimi, 2007). We demonstrate the performance of our model through an extensive numerical evaluation with some of the best known models from the literature. This rigorous comparison further elucidates that our model uses fewer binary variables, continuous variables and constraints. © 2009 Elsevier B. V. All rights reserved.
Source Title: Computer Aided Chemical Engineering
ISSN: 15707946
DOI: 10.1016/S1570-7946(09)70722-9
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.


checked on Mar 8, 2018

Page view(s)

checked on Mar 10, 2018

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.