Skip to main content Accessibility help
×
Hostname: page-component-84b7d79bbc-dwq4g Total loading time: 0 Render date: 2024-07-25T13:28:39.868Z Has data issue: false hasContentIssue false

5 - Multistage Environment

from Part II - Basic Methods

Published online by Cambridge University Press:  01 May 2021

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

Summary

In this chapter, we discuss scheduling in multistage environments. The problem statement is presented in Section 5.1 and three types of models are presented in Section 5.2 (sequence-based), Section 5.3 (continuous grid-based), and Section 5.4 (discrete grid-based). In Section 5.5, we introduce an important new feature, namely, storage constraints. Again, we build upon the material covered in the previous chapters to model assignment and sequencing decisions, as well as other constraints such as release and due times.

Type
Chapter
Information
Chemical Production Scheduling
Mixed-Integer Programming Models and Methods
, pp. 128 - 146
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

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.CrossRefGoogle 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.Google Scholar
Lamba, N, Karimi, IA. Scheduling Parallel Production Lines with Resource Constraints. 1. Model Formulation. Ind Eng Chem Res. 2002;41(4):779789.CrossRefGoogle 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.CrossRefGoogle 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.Google 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.CrossRefGoogle 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.CrossRefGoogle 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.Google 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.Google 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.CrossRefGoogle 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.CrossRefGoogle Scholar
Sundaramoorthy, A, Maravelias, CT. Modeling of Storage in Batching and Scheduling of Multistage Processes. Ind Eng Chem Res. 2008;47(17):66486660.CrossRefGoogle Scholar
Sundaramoorthy, A, Maravelias, CT, Prasad, P. Scheduling of Multistage Batch Processes under Utility Constraints. Ind Eng Chem Res. 2009;48(13):60506058.Google 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.Google Scholar
Neumann, K, Schwindt, C, Trautmann, N. Advanced Production Scheduling for Batch Plants in Process Industries. Or Spectrum. 2002;24(3):251279.CrossRefGoogle Scholar
Roe, B, Papageorgiou, LG, Shah, N. A Hybrid MILP/CLP Algorithm for Multipurpose Batch Process Scheduling. Comput Chem Eng. 2005;29(6):12771291.CrossRefGoogle 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.

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.

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.

Available formats
×