Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
Hostname: page-component-cd9895bd7-q99xh Total loading time: 0 Render date: 2024-12-24T03:32:21.707Z Has data issue: false hasContentIssue false

Part I - Background

Published online by Cambridge University Press:  01 May 2021

Christos T. Maravelias
Christos T. Maravelias
Affiliation:
Princeton University, New Jersey
Get access

Summary

A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Chapter
Information
Chemical Production Scheduling
Mixed-Integer Programming Models and Methods
 , pp. 1 - 64
Publisher: Cambridge University Press
Print publication year: 2021

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

References

Pinedo, M. Scheduling: Theory, Algorithms, and Systems. 3rd ed. New York; London: Springer; 2008.Google Scholar
Baker, KR. Introduction to Sequencing and Scheduling. New York: Wiley; 1974.Google Scholar
French, S. Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop. Chichester, New York: E. Horwood; Wiley; 1982.Google Scholar
Baker, KR, Trietsch, D. Principles of Sequencing and Scheduling. Hoboken: Wiley; 2009.Google Scholar
Maravelias, CT. General Framework and Modeling Approach Classification for Chemical Production Scheduling. AlChE J. 2012;58(6):1812–1828.CrossRefGoogle Scholar
Mendez, CA, Cerda, J, Grossmann, IE, Harjunkoski, I, Fahl, M. State-of-the-Art Review of Optimization Methods for Short-Term Scheduling of Batch Processes. Comput Chem Eng. 2006;30(6-7):913–946.Google Scholar
Harjunkoski, I, Maravelias, CT, Bongers, P, Castro, PM, Engell, S, Grossmann, IE, et al. Scope for Industrial Applications of Production Scheduling Models and Solution Methods. Comput Chem Eng. 2014;62(0):161–193.CrossRefGoogle Scholar
Stadtler, H. Supply Chain Management and Advanced Planning – Basics, Overview and Challenges. Eur J Oper Res. 2005;163(3):575–588.Google Scholar
Shapiro, JF. Modeling the Supply Chain. 2nd ed. Belmont: Thomson-Brooks/Cole; 2007.Google Scholar
Pochet, Y, Wolsey, LA. Production Planning by Mixed Integer Programming. New York; Berlin: Springer; 2006.Google Scholar
Kondili, E, Pantelides, CC, Sargent, RWH. A General Algorithm for Short-Term Scheduling of Batch-Operations. 1. Milp Formulation. Comput Chem Eng. 1993;17(2):211–227.Google Scholar
Shah, N, Pantelides, CC, Sargent, RWH. A General Algorithm for Short-Term Scheduling of Batch-Operations .2. Computational Issues. Comput Chem Eng. 1993;17(2):229–244.Google Scholar
Pantelides, CC, editor Unified Frameworks for Optimal Process Planning and Scheduling. 2nd Conference on Foundations of Computer Aided Process Operations; 1994; Snowmass: CACHE Publications.Google Scholar
Velez, S, Maravelias, CT. Advances in Mixed-Integer Programming Methods for Chemical Production Scheduling. Annu Rev Chem Biomol. 2014;5:97–121.CrossRefGoogle ScholarPubMed
Haupt, R. A Survey of Priority Rule-Based Scheduling. Or Spektrum. 1989;11(1):3–16.Google Scholar
Carlier, J, Pinson, E. An Algorithm for Solving the Job-Shop Problem. Manage Sci. 1989;35(2):164–176.CrossRefGoogle Scholar
Adams, J, Balas, E, Zawack, D. The Shifting Bottleneck Procedure for Job Shop Scheduling. Manage Sci. 1988;34(3):391–401.CrossRefGoogle Scholar
Baptiste, P, Le Pape, C, Nuijten, W. Constraint-Based Scheduling: Applying Constraint Programming to Scheduling Problems. Boston: Kluwer Academic; 2001.Google Scholar
Van Hentenryck, P, Michel, L. Constraint-Based Local Search. Cambridge: MIT Press; 2005.Google Scholar
Hooker, J. Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction. New York: John Wiley & Sons; 2000.Google Scholar
Panek, S, Engell, S, Subbiah, S, Stursberg, O. Scheduling of Multi-product Batch Plants Based upon Timed Automata Models. Comput Chem Eng. 2008;32(1-2):275–291.Google Scholar
Hooker, JN. Logic, Optimization, and Constraint Programming. INFORMS Journal on Computing. 2002;14(4):295–321.Google Scholar
Nemhauser, GL, Wolsey, LA. Integer and Combinatorial Optimization. New York: Wiley; 1988.Google Scholar
Wolsey, LA. Integer Programming. New York: Wiley; 1998.Google Scholar

References

Dantzig, G, Fulkerson, R, Johnson, S. Solution of a Large-Scale Traveling-Salesman Problem. Journal of the Operations Research Society of America. 1954;2(4):393–410.CrossRefGoogle Scholar
Gomory, RE. Outline of an Algorithm for Integer Solutions to Linear Programs. Bull Amer Math Soc. 1958;64:275–278.Google Scholar
Land, AH, Doig, AG. An Automatic Method of Solving Discrete Programming Problems. Econometrica. 1960;28(3):497–520.Google Scholar
Dakin, RJ. A Tree-Search Algorithm for Mixed Integer Programming Problems. Computer Journal. 1965;8(3):250–253.Google Scholar
Bixby, R, Rothberg, E. Progress in Computational Mixed Integer Programming – a Look Back from the Other Side of the Tipping Point. Annals of Operations Research. 2007;149(1):37–41.Google Scholar
Williams, HP. Model Building in Mathematical Programming. 5th ed. Hoboken: Wiley; 2013.Google Scholar
Balas, E. Note on Duality in Disjunctive Programming. Journal of Optimization Theory and Applications. 1977;21(4):523–528.CrossRefGoogle Scholar
Balas, E. Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems. Siam J Algebra Discr. 1985;6(3):466–486.CrossRefGoogle Scholar
Raman, R, Grossmann, IE. Modeling and Computational Techniques for Logic-Based Integer Programming. Comput Chem Eng. 1994;18(7):563–578.CrossRefGoogle Scholar
Turkay, M, Grossmann, IE. Disjunctive Programming Techniques for the Optimization of Process Systems with Discontinuous Investment Costs Multiple Size Regions. Ind Eng Chem Res. 1996;35(8):2611–2623.Google Scholar
Nemhauser, GL, Wolsey, LA. Integer and Combinatorial Optimization. New York: Wiley; 1988.CrossRefGoogle Scholar
Wolsey, LA. Integer Programming. New York: Wiley; 1998.Google Scholar
West, DB. Introduction to Graph Theory. 2nd ed. Upper Saddle River: Prentice Hall; 2001.Google Scholar
Ahuja, RK, Magnanti, TL, Orlin, JB. Network Flows : Theory, Algorithms, and Applications. Englewood Cliffs: Prentice Hall; 1993.Google Scholar
Benders, JF. Partitioning Procedures for Solving Mixed-Variables Programming Problems. Numerische Mathematik. 1962;4(1):238–252.Google Scholar
Fisher, ML. The Lagrangian Relaxation Method for Solving Integer Programming Problems. Manage Sci. 1981;27(1):1–18.Google Scholar
Atamturk, A, Savelsbergh, MWP. Integer-Programming Software Systems. Annals of Operations Research. 2005;140(1):67–124.Google Scholar
Belotti, P, Kirches, C, Leyffer, S, Linderoth, J, Luedtke, J, Mahajan, A. Mixed-Integer Nonlinear Optimization. Acta Numerica. 2013;22:1–131.CrossRefGoogle Scholar
Kronqvist, J, Bernal, DE, Lundell, A, Grossmann, IE. A Review and Comparison of Solvers for Convex MINLP. Optim. Eng. 2019;20(2):397–455.Google Scholar

Save book to Kindle

To save this book to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

  • Background
  • Christos T. Maravelias, Princeton University, New Jersey
  • Book: Chemical Production Scheduling
  • Online publication: 01 May 2021
  • Chapter DOI: https://doi.org/10.1017/9781316650998.002
Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

  • Background
  • Christos T. Maravelias, Princeton University, New Jersey
  • Book: Chemical Production Scheduling
  • Online publication: 01 May 2021
  • Chapter DOI: https://doi.org/10.1017/9781316650998.002
Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

  • Background
  • Christos T. Maravelias, Princeton University, New Jersey
  • Book: Chemical Production Scheduling
  • Online publication: 01 May 2021
  • Chapter DOI: https://doi.org/10.1017/9781316650998.002
Available formats
×