Please use this identifier to cite or link to this item: https://doi.org/10.1016/j.compchemeng.2007.02.002
Title: Scheduling multistage batch plants with parallel units and no interstage storage
Authors: Liu, Y.
Karimi, I.A. 
Keywords: Batch plant
Interstage storage configurations
MILP formulation
Multiproduct
Scheduling
Issue Date: 5-Apr-2008
Source: Liu, Y., Karimi, I.A. (2008-04-05). Scheduling multistage batch plants with parallel units and no interstage storage. Computers and Chemical Engineering 32 (4-5) : 671-693. ScholarBank@NUS Repository. https://doi.org/10.1016/j.compchemeng.2007.02.002
Abstract: Scheduling production optimally in multistage multiproduct plants with parallel units is a very difficult but routine problem. While most batch plants avoid interstage storage due to minimize contamination, cleaning, waste, and so forth, the scheduling of plants with no interstage storage and mixed wait policies have received little attention compared to those with unlimited storage/wait. In this paper, we develop and evaluate several different mixed-integer linear programming formulations for scheduling plants with identical and nonidentical parallel processing units and unlimited and zero-wait interstage policies. Because the best approach for handling identical parallel units seems to be sequence-based and that for handling nonidentical units seems to be slot-based, we employ judicious mixes of these approaches to address real plants with mixes of stages with identical and nonidentical units. Our models also allow mixes of unlimited and zero interstage wait policies and scheduling objectives of makespan, tardiness, earliness, and weighted just-in-time. The weighted just-in-time scheduling seems to be more difficult than even the makespan scheduling, and more importantly, a modeling approach that does well for the former does not necessarily suit the latter. While the models presented in this paper do address successfully the scheduling needs of realistic batch plants, considerable future work is warranted for models that can solve large scheduling problems of this type. © 2007 Elsevier Ltd. All rights reserved.
Source Title: Computers and Chemical Engineering
URI: http://scholarbank.nus.edu.sg/handle/10635/64548
ISSN: 00981354
DOI: 10.1016/j.compchemeng.2007.02.002
Appears in Collections:Staff Publications

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

SCOPUSTM   
Citations

46
checked on Dec 7, 2017

WEB OF SCIENCETM
Citations

38
checked on Nov 23, 2017

Page view(s)

23
checked on Dec 11, 2017

Google ScholarTM

Check

Altmetric


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