DSpace
 

Researchspace >
General science, engineering & technology >
General science, engineering & technology >
General science, engineering & technology >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10204/5377

Title: A robust mathematical formulation for multipurpose batch plants
Authors: Seid, R
Majozi, T
Keywords: Scheduling techniques
Batch plants
Mixed integer linear programming
Chemical engineering science
Issue Date: Jan-2012
Publisher: Elsevier
Citation: Seid, R and Majozi, T. 2012. Robust mathematical formulation for multipurpose batch plants. Chemical Engineering Science, Vol 68(1), pp 36-53
Series/Report no.: Workflow request;7602
Abstract: Several scheduling techniques exist in literature based on continuous time representation. The models based on unit specific time points have shown better solution efficiency by reducing the number of time points and problem size. In this paper novel scheduling techniques based on unit specific time point continuous time representation are presented. The proposed models allow nonsimultaneous material transfer into a unit. Nonsimultaneous transfer refers to when a task requires more than one intermediate state it is possible for one state to be transferred and stored in a unit that is processing it for a while and wait for the other intermediates to come together to start the task. This approach gives a better schedule as compared to most published models. The developed MILP scheduling models are based on state sequence network representation that has proven to inherently result in smaller problems in terms of binary variables. The models require a smaller number of time points as compared to single-grid and multi-grid continuous time models. Consequently, they exhibit much better computational performance. Numerical evaluation using literature examples indicate in some of the complex examples that the proposed models give a better objective value as compared to other scheduling models. An added feature of the proposed models is their ability to exactly handle fixed intermediate storage operational philosophy, which has proven to be a subtle drawback in most published scheduling techniques.
Description: Copyright: 2011 Elsevier. This is an ABSTRACT ONLY
URI: http://www.sciencedirect.com/science/article/pii/S0009250911006191
http://hdl.handle.net/10204/5377
ISSN: 0009-2509
Appears in Collections:Advanced mathematical modelling and simulation
General science, engineering & technology

Files in This Item:

File Description SizeFormat
Seid_2011_ABSTRACT ONLY.pdf16.78 kBAdobe PDFView/Open
View Statistics

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

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback