Valid Inequalities Based on Demand Propagation for Chemical Production Scheduling MIP Models

Sara Velez; Arul Sundaramoorthy; Christos T. Maravelias

doi:10.1002/aic.14021

journal article Feb 05, 2013

Valid Inequalities Based on Demand Propagation for Chemical Production Scheduling MIP Models

Sara Velez Arul Sundaramoorthy Christos T. Maravelias

AIChE Journal Vol. 59 No. 3 pp. 872-887 · Wiley

View at Publisher Save 10.1002/aic.14021

Abstract

Although several mixed‐integer programming (MIP) models have been proposed for the scheduling of chemical manufacturing facilities, the development of solution methods for these formulations has received limited attention. In this article, we develop a constraint propagation algorithm for the calculation of lower bounds on the number and size of tasks necessary to satisfy given demand. These bounds are then used to express four types of valid inequalities which greatly enhance the computational performance of the MIP scheduling model. Specifically, the addition of these inequalities leads to reductions in the computational requirements of more than three orders of magnitude, thereby allowing us to address medium‐sized problems of industrial relevance. Importantly, the proposed methods are applicable to a wide range of problem classes and time‐indexed MIP models for chemical production scheduling. © 2013 American Institute of Chemical Engineers AIChE J, 59:872‐887, 2013

Topics

No keywords indexed for this article. Browse by subject →

References

50

[1]

10.1016/j.compchemeng.2006.02.008

[2]

10.1002/aic.13801

[3]

10.1016/0098-1354(86)87002-8

[4]

Reklaitis GV "Review of Scheduling of Process Operation" AIChE Symp. Ser (1982)

[5]

10.1023/a:1018929829086

[6]

10.1023/a:1021856229236

[7]

10.1016/s0098-1354(01)00671-8

[8]

10.1016/j.compchemeng.2007.06.012

[9]

10.1021/ie070944y

[10]

10.1021/ie701737a

[11]

10.1021/ie801386m

[12]

10.1016/0098-1354(93)80015-f

[13]

10.1016/0098-1354(93)80016-g

[14]

PantelidesCC.Unified frameworks for optimal process planning and scheduling. In: Second Conference on Foundations of Computer Aided Process Operations 1994 Snowmass CO CACHE Publications.

[15]

10.1016/0098-1354(95)00186-7

[16]

10.1016/0098-1354(96)00211-6

[17]

10.1021/ie970927g

[18]

10.1021/ie970311r

[19]

10.1021/ie000683r

[20]

10.1021/ie020923y

[21]

10.1016/j.ces.2004.12.023

[22]

10.1021/ie0500117

[23]

10.1021/ie010399f

[24]

A novel network-based continuous-time representation for process scheduling: Part I. Main concepts and mathematical formulation

Diego M. Giménez, Gabriela P. Henning, Christos T. Maravelias

Computers & Chemical Engineering 10.1016/j.compchemeng.2009.03.007

[25]

10.1016/j.compchemeng.2007.09.001

[26]

10.1016/j.compchemeng.2009.05.015

[27]

10.1016/j.compchemeng.2011.11.004

[28]

10.1021/ie034053b

[29]

10.1016/j.compchemeng.2005.02.037

[30]

10.1016/j.compchemeng.2007.03.019

[31]

10.1016/j.compchemeng.2007.08.007

[32]

10.1287/ijoc.1090.0339

[33]

10.1021/ie101419z

[34]

A general framework for process scheduling

Arul Sundaramoorthy, Christos T. Maravelias

AIChE Journal 10.1002/aic.12300

[35]

Kelly JD "Crude oil blend scheduling optimization: an application with multimillion dollar benefits—Part 2—The ability to schedule the crude oil blendshop more effectively provides substantial downstream benefits" Hydrocarbon Process. (2003)

[36]

Kelly JD (2009)

[37]

10.1016/j.compchemeng.2009.06.002

[38]

Pochet Y (2006)

[39]

10.1016/0166-218x(90)90148-6

[40]

10.1007/s101070050071

[41]

10.1287/ijoc.12.2.111.11896

[42]

10.1002/9781118033036

[43]

10.1007/978-1-4615-1479-4

[44]

Hentenryck P (2005)

[45]

10.1287/opre.1060.0371

[46]

Lot-Sizing with Constant Batches: Formulation and Valid Inequalities

Yves Pochet, Laurence A. Wolsey

Mathematics of Operations Research 10.1287/moor.18.4.767

[47]

10.1016/s0377-2217(97)89646-4

[48]

10.1007/s10107-003-0397-3

[49]

10.1002/9781118627372

[50]

Wolsey LA (1998)

Metrics

42

Citations

50

References

Details

Published: Feb 05, 2013
Vol/Issue: 59(3)
Pages: 872-887
License: View

Authors

S

Sara Velez

Dept. of Chemical and Biological Engineering University of Wisconsin—Madison Madison WI 53706

A

Arul Sundaramoorthy

Dept. of Chemical and Biological Engineering University of Wisconsin—Madison Madison WI 53706

C

Christos T. Maravelias

Dept. of Chemical and Biological Engineering University of Wisconsin—Madison Madison WI 53706

Cite This Article

Sara Velez, Arul Sundaramoorthy, Christos T. Maravelias (2013). Valid Inequalities Based on Demand Propagation for Chemical Production Scheduling MIP Models. AIChE Journal, 59(3), 872-887. https://doi.org/10.1002/aic.14021

Valid Inequalities Based on Demand Propagation for Chemical Production Scheduling MIP Models

You May Also Like