MATHEMATICAL-PROGRAMMING FORMULATION FOR SCHEDULING OF BATCH-OPERATIONS BASED ON NONUNIFORM TIME DISCRETIZATION

Citation
L. Mockus et Gv. Reklaitis, MATHEMATICAL-PROGRAMMING FORMULATION FOR SCHEDULING OF BATCH-OPERATIONS BASED ON NONUNIFORM TIME DISCRETIZATION, Computers & chemical engineering, 21(10), 1997, pp. 1147-1156
Citations number
10
Categorie Soggetti
Computer Application, Chemistry & Engineering","Engineering, Chemical","Computer Science Interdisciplinary Applications
ISSN journal
00981354
Volume
21
Issue
10
Year of publication
1997
Pages
1147 - 1156
Database
ISI
SICI code
0098-1354(1997)21:10<1147:MFFSOB>2.0.ZU;2-Q
Abstract
A flexible formulation for handling a wide range of short-term schedul ing problems arising in multi-product/multipurpose batch chemical plan ts is presented. Time is directly used to model events arising in the schedule and thus use of binary variables over periods during which no changes in system state occur is avoided. Batch processes involving a variety of operational complexities can be readily represented. The s cheduling problem is formulated as a mixed integer nonlinear program ( MINLP). The resulting model can be simplified via exact linearization to yield a mixed integer bilinear program (MIBLP) in which the only no nlinearity arises in the objective function as a product of continuous variables. A preliminary computational comparison is made against a u niform time discretization formulation. (C) 1997 Elsevier Science Ltd.