Skip to main content Accessibility help
×
Hostname: page-component-848d4c4894-mwx4w Total loading time: 0 Render date: 2024-07-04T16:08:50.120Z Has data issue: false hasContentIssue false

Part II - Basic Methods

Published online by Cambridge University Press:  01 May 2021

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

Summary

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. 65 - 190
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

Sousa, JP, Wolsey, LA. A Time Indexed Formulation of Nonpreemptive Single-Machine Scheduling Problems. Math Program. 1992;54(3):353367.Google Scholar
Wolsey, LA. Valid Inequalities for 0-1 Knapsacks and MIPs with Generalized Upper Bound Constraints. Discrete Applied Mathematics. 1990;29(2–3):251261.Google Scholar
van den Akker, JM, Hurkens, CAJ, Savelsbergh, MWP. Time-Indexed Formulations for Machine Scheduling Problems: Column Generation. INFORMS J Comput. 2000;12(2):111124.Google Scholar
Sadykov, R, Wolsey, LA. Integer Programming and Constraint Programming in Solving a Multimachine Assignment Scheduling Problem with Deadlines and Release Dates. INFORMS J Comput. 2006;18(2):209217.Google Scholar
van den Akker, JM, van Hoesel, CPM, Savelsbergh, MWP. A Polyhedral Approach to Single-Machine Scheduling Problems. Math Program. 1999;85(3):541572.CrossRefGoogle Scholar
Pekny, JF, Miller, DL, Mcrae, GJ. An Exact Parallel Algorithm for Scheduling When Production Costs Depend on Consecutive System States. Comput Chem Eng. 1990;14(9):10091023.CrossRefGoogle 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):211227.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):229244.Google Scholar
Karmarkar, US, Schrage, L. The Deterministic Dynamic Product Cycling Problem. Oper Res. 1985;33(2):326345.Google Scholar
Kelly, JD, Zyngier, D. An Improved MILP Modeling of Sequence-Dependent Switchovers for Discrete-Time Scheduling Problems. Ind Eng Chem Res. 2007;46(14):49644973.CrossRefGoogle Scholar
Velez, S, Dong, Y, Maravelias, CT. Changeover Formulations for Discrete-Time Mixed-Integer Programming Scheduling Models. Eur J Oper Res. 2017;260(3):949963.CrossRefGoogle Scholar
Wolsey, LA. MIP modelling of changeovers in production planning and scheduling problems. Eur J Oper Res. 1997;99(1):154-65.Google Scholar
Lasserre, JB, Queyranne, M, editors. Generic Scheduling Polyhedra and a New Mixed-Integer Formulation for Single-Machine Scheduling. Paper from the conference IPCO: Integer Programming and Combinatorial Optimization. 1992.Google Scholar
Kopanos, GM, Puigjaner, L, Maravelias, CT. Production Planning and Scheduling of Parallel Continuous Processes with Product Families. Ind Eng Chem Res. 2011;50(3):13691378.Google Scholar
Lima, RM, Grossmann, IE, Jiao, Y. Long-Term Scheduling of a Single-Unit Multi-Product Continuous Process to Manufacture High Performance Glass. Comput Chem Eng. 2011;35(3):554574.Google Scholar

References

Blazewicz, J, Dror, M, Weglarz, J. Mathematical-Programming Formulations for Machine Scheduling – a Survey. Eur J Oper Res. 1991;51(3):283300.CrossRefGoogle Scholar
Pinto, JM, Grossmann, IE. A Continuous-Time Mixed-Integer Linear-Programming Model for Short-Term Scheduling of Multistage Batch Plants. Ind Eng Chem Res. 1995;34(9):30373051.Google Scholar
Cerda, J, Henning, GP, Grossmann, IE. A Mixed-Integer Linear Programming Model for Short-Term Scheduling of Single-Stage Multiproduct Batch Plants with Parallel Lines. Ind Eng Chem Res. 1997;36(5):16951707.CrossRefGoogle Scholar
Mendez, CA, Henning, GP, Cerda, J. Optimal Scheduling of Batch Plants Satisfying Multiple Product Orders with Different Due-Dates. Comput Chem Eng. 2000;24(9-10):22232245.Google Scholar
Lim, M-F, Karimi, IA. A Slot-Based Formulation for Single-Stage Multiproduct Batch Plants with Multiple Orders per Product. Ind Eng Chem Res. 2003;42(9):19141924.CrossRefGoogle Scholar
Castro, PA, Grossmann, IE. An Efficient MILP Model for the Short-Term Scheduling of Single Stage Batch Plants. Comput Chem Eng. 2006;30(6–7):10031018.CrossRefGoogle Scholar
Marchetti, PA, Mendez, CA, Cerda, J. Mixed-Integer Linear Programming Monolithic Formulations for Lot-Sizing and Scheduling of Single-Stage Batch Facilities. Ind Eng Chem Res. 2010;49(14):64826498.CrossRefGoogle Scholar
Velez, S, Dong, YC, Maravelias, CT. Changeover Formulations for Discrete-Time Mixed-Integer Programming Scheduling Models. Eur J Oper Res. 2017;260(3):949963.Google Scholar
Castro, PM, Grossmann, IE. Generalized Disjunctive Programming as a Systematic Modeling Framework to Derive Scheduling Formulations. Ind Eng Chem Res. 2012;51(16):57815792.Google Scholar
Maravelias, CT, Grossmann, IE. New General Continuous-Time State-Task Network Formulation for Short-Term Scheduling of Multipurpose Batch Plants. Ind Eng Chem Res. 2003;42(13):30563074.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):211227.Google Scholar
Pantelides, CC, editor, Unified Frameworks for Optimal Process Planning and Scheduling. 2nd Conference on Foundations of Computer Aided Process Operations; 1994 1994; Snowmass, CO: CACHE Publications.Google Scholar

References

Mendez, CA, Henning, GP, Cerda, J. An MILP Continuous-Time Approach to Short-Term Scheduling of Resource-Constrained Multistage Flowshop Batch Facilities. Comput Chem Eng. 2001;25(4–6):701711.CrossRefGoogle Scholar
Gupta, S, Karimi, IA. An Improved MILP Formulation for Scheduling Multiproduct, Multistage Batch Plants. Ind Eng Chem Res. 2003;42(11):23652380.CrossRefGoogle Scholar
Pinto, JM, Grossmann, IE. A Continuous-Time Mixed-Integer Linear-Programming Model for Short-Term Scheduling of Multistage Batch Plants. Ind Eng Chem Res. 1995;34(9):30373051.Google Scholar
Pinto, JM, Grossmann, IE. An Alternate MILP Model for Short-Term Scheduling of Batch Plants with Preordering Constraints. Ind Eng Chem Res. 1996;35(1):338342.CrossRefGoogle Scholar
Lamba, N, Karimi, IA. Scheduling Parallel Production Lines with Resource Constraints. 1. Model Formulation. Ind Eng Chem Res. 2002;41(4):779789.Google Scholar
Castro, PM, Grossmann, IE. New Continuous-Time MILP Model for the Short-Term Scheduling of Multistage Batch Plants. Ind Eng Chem Res. 2005;44(24):91759190.Google Scholar
Castro, PM, Grossmann, IE, Novais, AQ. Two New Continuous-Time Models for the Scheduling of Multistage Batch Plants with Sequence Dependent Changeovers. Ind Eng Chem Res. 2006;45(18):62106226.CrossRefGoogle Scholar
Merchan, AF, Lee, H, Maravelias, CT. Discrete-Time Mixed-Integer Programming Models and Solution Methods for Production Scheduling in Multistage Facilities. Comput Chem Eng. 2016;94:387410.CrossRefGoogle Scholar
Pritsker, AAB, Waiters, LJ, Wolfe, PM. Multiproject Scheduling with Limited Resources: A Zero-One Programming Approach. Manage Sci. 1969;16(1):93108.Google Scholar
Christofides, N, Alvarez-Valdes, R, Tamarit, JM. Project Scheduling with Resource Constraints – a Branch and Bound Approach. Eur J Oper Res. 1987;29(3):262273.CrossRefGoogle Scholar
Ku, HM, Karimi, IA. Scheduling in Serial Multiproduct Batch Processes with Finite Interstage Storage – a Mixed Integer Linear Program Formulation. Ind Eng Chem Res. 1988;27(10):18401848.Google Scholar
Kim, M, Jung, JH, Lee, IB. Optimal Scheduling of Multiproduct Batch Processes for Various Intermediate Storage Policies. Ind Eng Chem Res. 1996;35(11):40584066.Google Scholar
Kim, SB, Lee, HK, Lee, IB, Lee, ES, Lee, B. Scheduling of Non-sequential Multipurpose Batch Processes under Finite Intermediate Storage Policy. Comput Chem Eng. 2000;24(2–7):16031610.CrossRefGoogle Scholar
Mendez, CA, Cerda, J. An MILP Continuous-Time Framework for Short-Term Scheduling of Multipurpose Batch Processes under Different Operation Strategies. Optimization and Engineering. 2003;4(1–2):722.CrossRefGoogle Scholar
Wu, JY, He, XR. A New Model for Scheduling of Batch Process with Mixed Intermediate Storage Policies. Journal of the Chinese Institute of Chemical Engineers. 2004;35(3):381387.Google Scholar
Gupta, S, Karimi, IA. Scheduling a Two-Stage Multiproduct Process with Limited Product Shelf Life in Intermediate Storage. Ind Eng Chem Res. 2003;42(3):490508.CrossRefGoogle Scholar
Liu, Y, Karimi, IA. Novel Continuous-Time Formulations for Scheduling Multi-Stage Batch Plants with Identical Parallel Units. Comput Chem Eng. 2007;31(12):16711693.Google Scholar
Liu, Y, Karimi, IA. Scheduling Multistage Batch Plants with Parallel Units and No Interstage Storage. Comput Chem Eng. 2008;32(4–5):671693.Google Scholar
Prasad, P, Maravelias, CT. Batch Selection, Assignment and Sequencing in Multi-Stage Multi-Product Processes. Comput Chem Eng. 2008;32(6):11061119.Google Scholar
Sundaramoorthy, A, Maravelias, CT. Simultaneous Batching and Scheduling in Multistage Multiproduct Processes. Ind Eng Chem Res. 2008;47(5):15461555.Google Scholar
Sundaramoorthy, A, Maravelias, CT. Modeling of Storage in Batching and Scheduling of Multistage Processes. Ind Eng Chem Res. 2008;47(17):66486660.Google Scholar
Sundaramoorthy, A, Maravelias, CT, Prasad, P. Scheduling of Multistage Batch Processes under Utility Constraints. Ind Eng Chem Res. 2009;48(13):60506058.CrossRefGoogle Scholar
Baumann, P, Trautmann, N. A Continuous-Time MILP Model for Short-Term Scheduling of Make-and-Pack Production Processes. International Journal of Production Research. 2013;51(6):17071727.CrossRefGoogle Scholar
Harjunkoski, I, Grossmann, IE. Decomposition Techniques for Multistage Scheduling Problems Using Mixed-Integer and Constraint Programming Methods. Comput Chem Eng. 2002;26(11):15331552.Google Scholar
Maravelias, CT. A Decomposition Framework for the Scheduling of Single- and Multi-Stage Processes. Comput Chem Eng. 2006;30(3):407420.CrossRefGoogle Scholar
Neumann, K, Schwindt, C, Trautmann, N. Advanced Production Scheduling for Batch Plants in Process Industries. Or Spectrum. 2002;24(3):251279.Google Scholar
Roe, B, Papageorgiou, LG, Shah, N. A Hybrid MILP/CLP Algorithm for Multipurpose Batch Process Scheduling. Comput Chem Eng. 2005;29(6):12771291.Google Scholar

References

Gomes, MC, Barbosa-Povoa, AP, Novais, AQ. Reactive Scheduling in a Make-to-Order Flexible Job Shop with Re-entrant Process and Assembly: A Mathematical Programming Approach. Int. J. Prod. Res. 2013;51(17):51205141.Google Scholar
Gomes, MC, Barbosa-Povoa, AP, Novais, AQ. Optimal Scheduling for Flexible Job Shop Operation. Int. J. Prod. Res. 2005;43(11):23232353.Google Scholar
Fattahi, P, Jolai, F, Arkat, J. Flexible Job Shop Scheduling with Overlapping in Operations. Appl Math Model. 2009;33(7):30763087.Google Scholar
Fattahi, P, Mehrabad, MS, Jolai, F. Mathematical Modeling and Heuristic Approaches to Flexible Job Shop Scheduling Problems. J Intell Manuf. 2007;18(3):331342.Google Scholar
Demir, Y, Isleyen, SK. Evaluation of Mathematical Models for Flexible Job-Shop Scheduling Problems. Appl Math Model. 2013;37(3):977988.Google Scholar
Maravelias, CT. General Framework and Modeling Approach Classification for Chemical Production Scheduling. AlChE J. 2012;58(6):18121828.Google Scholar
Lee, H, Maravelias, CT. Discrete-Time Mixed-Integer Programming Models for Short-Term Scheduling in Multipurpose Environments. Comput Chem Eng. 2017;107:171183.Google Scholar
Kim, YJ, Kim, MH, Jung, JH. Optimal Scheduling of the Single Line Multi-Purpose Batch Process with Re-Circulation Products. J. Chem. Eng. Japan. 2002;35(2):117130.Google Scholar
Mendez, CA, Cerda, J. An MILP Continuous-Time Framework for Short-Term Scheduling of Multipurpose Batch Processes Under Different Operation Strategies. Optim. Eng. 2003;4(1-2):722.CrossRefGoogle Scholar
Ferrer-Nadal, S, Capon-Garcia, E, Mendez, CA, Puigjaner, L. Material Transfer Operations in Batch Scheduling. A Critical Modeling Issue. Ind Eng Chem Res. 2008;47(20):77217732.Google Scholar
Lee, H, Maravelias, CT. Mixed-Integer Programming Models for Simultaneous Batching and Scheduling in Multipurpose Batch Plants. Comput Chem Eng. 2017;106:621644.CrossRefGoogle Scholar

References

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):211227.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):229244.Google Scholar
Pantelides, CC, editor Unified Frameworks for Optimal Process Planning and Scheduling. 2nd Conference on Foundations of Computer Aided Process Operations; 1994 1994; Snowmass, CO: CACHE Publications.Google Scholar
BarbosaPovoa, APFD, Pantelides, CC. Design of Multipurpose Plants Using the Resource-Task Network Unified Framework. Comput Chem Eng. 1997;21:S703S708.CrossRefGoogle Scholar
Zentner, MG, Pekny, JF, Reklaitis, GV, Gupta, JND. Practical Considerations in Using Model-Based Optimization for the Scheduling and Planning of Batch/Semicontinuous Processes. Journal of Process Control. 1994;4(4):259280.Google Scholar
Subrahmanyam, S, Bassett, MH, Pekny, JF, Reklaitis, GV. Issues in Solving Large-Scale Planning, Design and Scheduling Problems in Batch Chemical Plants. Comput Chem Eng. 1995;19:S577S582.Google Scholar
Schilling, G, Pantelides, CC. A Simple Continuous-Time Process Scheduling Formulation and a Novel Solution Algorithm. Comput Chem Eng. 1996;20:S1221S1226.Google Scholar
Zhang, X, Sargent, RWH. The Optimal Operation of Mixed Production Facilities – a General Formulation and Some Approaches for the Solution. Comput Chem Eng. 1996;20(6–7):897904.Google Scholar
Zhang, XY, Sargent, RWH. The Optimal Operation of Mixed Production Facilities – Extensions and Improvements. Comput Chem Eng. 1996;20:S1287S1293.Google Scholar
Mockus, L, Reklaitis, GV. Continuous Time Representation Approach to Batch and Continuous Process Scheduling. 1. MINLP Formulation. Ind Eng Chem Res. 1999;38(1):197203.Google Scholar
Mockus, L, Reklaitis, GV. Continuous Time Representation Approach to Batch and Continuous Process Scheduling. 2. Computational Issues. Ind Eng Chem Res. 1999;38(1):204210.Google Scholar
Lee, KH, Park, HI, Lee, IB. A Novel Nonuniform Discrete Time Formulation for Short-Term Scheduling of Batch and Continuous Processes. Ind Eng Chem Res. 2001;40(22):49024911.Google Scholar
Castro, P, Barbosa-Povoa, APFD, Matos, H. An Improved RTN Continuous-Time Formulation for the Short-Term Scheduling of Multipurpose Batch Plants. Ind Eng Chem Res. 2001;40(9):20592068.Google Scholar
Sundaramoorthy, A, Karimi, IA. A Simpler Better Slot-Based Continuous-Time Formulation for Short-Term Scheduling in Multipurpose Batch Plants. Chem Eng Sci. 2005;60(10):26792702.CrossRefGoogle Scholar
Gimenez, DM, Henning, GP, Maravelias, CT. A Novel Network-Based Continuous-Time Representation for Process Scheduling: Part II. General Framework. Comput Chem Eng. 2009;33(10):16441660.Google Scholar
Gimenez, DM, Henning, GP, Maravelias, CT. A Novel Network-Based Continuous-Time Representation for Process Scheduling: Part I. Main Concepts and Mathematical Formulation. Comput Chem Eng. 2009;33(9):15111528.Google Scholar
Ierapetritou, MG, Floudas, CA. Effective Continuous-Time Formulation for Short-Term Scheduling. 1. Multipurpose Batch Processes. Ind Eng Chem Res. 1998;37(11):43414359.CrossRefGoogle Scholar
Ierapetritou, MG, Floudas, CA. Effective Continuous-Time Formulation for Short-Term Scheduling. 2. Continuous and Semicontinuous Processes. Ind Eng Chem Res. 1998;37(11):43604374.Google Scholar
Giannelos, NF, Georgiadis, MC. A Novel Event-Driven Formulation for Short-Term Scheduling of Multipurpose Continuous Processes. Ind Eng Chem Res. 2002;41(10):24312439.Google Scholar
Giannelos, NF, Georgiadis, MC. A Simple New Continuous-Time Formulation for Short-Term Scheduling of Multipurpose Batch Processes. Ind Eng Chem Res. 2002;41(9):21782184.Google Scholar
Janak, SL, Lin, XX, Floudas, CA. Enhanced Continuous-Time Unit-Specific Event-Based Formulation for Short-Term Scheduling of Multipurpose Batch Processes: Resource Constraints and Mixed Storage Policies. Ind Eng Chem Res. 2004;43(10):25162533.Google Scholar
Janak, SL, Floudas, CA. Improving Unit-Specific Event Based Continuous-Time Approaches for Batch Processes: Integrality Gap and Task Splitting. Comput Chem Eng. 2008;32(4–5):913955.Google Scholar
Susarla, N, Li, J, Karimi, IA. A Novel Approach to Scheduling Multipurpose Batch Plants Using Unit-Slots. AlChE J. 2010;56(7):18591879.Google Scholar
Maravelias, CT. Mixed-Time Representation for State-Task Network Models. Ind Eng Chem Res. 2005;44(24):91299145.Google Scholar
Kelly, JD, Zyngier, D. Unit-Operation Nonlinear Modeling for Planning and Scheduling Applications. Optimization and Engineering. 2017;18(1):133154.Google Scholar
Zyngier, D, Kelly, JD. Multiproduct Inventory Logistics Modeling in the Process Industries. Springer Ser Optim A. 2009;30:6195.Google Scholar
Sundaramoorthy, A, Maravelias, CT. A General Framework for Process Scheduling. AlChE J. 2011;57(3):695710.Google Scholar
Velez, S, Maravelias, CT. Mixed-Integer Programming Model and Tightening Methods for Scheduling in General Chemical Production Environments. Ind Eng Chem Res. 2013;52(9):34073423.CrossRefGoogle Scholar
Sundaramoorthy, A, Maravelias, CT. Computational Study of Network-Based Mixed-Integer Programming Approaches for Chemical Production Scheduling. Ind Eng Chem Res. 2011;50(9):50235040.Google Scholar
Velez, S, Maravelias, CT. Advances in Mixed-Integer Programming Methods for Chemical Production Scheduling. Annu Rev Chem Biomol. 2014;5:97121.Google Scholar

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org 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.

  • Basic Methods
  • Christos T. Maravelias, Princeton University, New Jersey
  • Book: Chemical Production Scheduling
  • Online publication: 01 May 2021
  • Chapter DOI: https://doi.org/10.1017/9781316650998.005
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.

  • Basic Methods
  • Christos T. Maravelias, Princeton University, New Jersey
  • Book: Chemical Production Scheduling
  • Online publication: 01 May 2021
  • Chapter DOI: https://doi.org/10.1017/9781316650998.005
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.

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