Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/89602
Title: Novel continuous-time formulations for scheduling multi-stage batch plants with identical parallel units
Authors: Liu, Y.
Karimi, I.A. 
Keywords: Batch plant
Makespan
Mathematical programming
MILP
Multi-product
Multi-stage
Scheduling
Issue Date: Dec-2007
Source: Liu, Y., Karimi, I.A. (2007-12). Novel continuous-time formulations for scheduling multi-stage batch plants with identical parallel units. Computers and Chemical Engineering 31 (12) : 1671-1693. ScholarBank@NUS Repository.
Abstract: Scheduling production optimally in multi-stage multi-product plants is a very difficult problem that has received limited attention. While the case of non-identical parallel units has been addressed, the case of identical parallel units is equally worthy of attention, as many plants are or can be approximated as such. In this paper, we construct and compare several novel MILP formulations for the latter. In contrast to the existing work, we increase solution efficiency by considering each stage as a block of multiple identical units, thereby eliminating numerous binary variables for assigning batches to specific units. Interestingly, a novel formulation using an adjacent pair-wise sequencing approach proves superior to slot-based formulations. Furthermore, we develop heuristic variations of our proposed formulations to address moderate-size problems. A novel heuristic strategy inspired from list scheduling algorithms seems to be efficient for moderate-size problems and scales well with problem size. © 2007 Elsevier Ltd. All rights reserved.
Source Title: Computers and Chemical Engineering
URI: http://scholarbank.nus.edu.sg/handle/10635/89602
ISSN: 00981354
Appears in Collections:Staff Publications

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

SCOPUSTM   
Citations

20
checked on Mar 8, 2018

WEB OF SCIENCETM
Citations

18
checked on Apr 16, 2018

Page view(s)

15
checked on Mar 12, 2018

Google ScholarTM

Check


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