Skip to main content Accessibility help
×
Hostname: page-component-848d4c4894-ndmmz Total loading time: 0 Render date: 2024-05-20T07:52:55.163Z Has data issue: false hasContentIssue false

10 - Periodic Scheduling

from Part III - Advanced Methods

Published online by Cambridge University Press:  01 May 2021

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

Summary

In Chapter 1, we discussed how the market environment affects the scheduling of manufacturing facilities primarily because the volume and variability of product demand determine the regularity and frequency in which scheduling is performed. The production of high-volume products with relatively constant demand or high-volume intermediates can be based on demand forecasts, rather than specific orders. If the forecasts do not exhibit significant fluctuations over time, one approach is to generate a schedule that can be repeated periodically, to maintain a certain level of stock. The process of generating such schedules, which is the topic of the present chapter, is termed periodic scheduling. In Section 10.1, we use the single-unit environment to motivate the need for periodic scheduling, define relevant notation, and present some preliminary concepts and models. In Section 10.2, we use the single-stage environment to discuss some additional concepts and one formulation. Finally, in Section 10.3, we present periodic scheduling in network environments.We consider processes without any of the processing features discussed in Chapter 8.

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

Wu, Y, Maravelias, CT. A General Model for Periodic Chemical Production Scheduling. Ind Eng Chem Res. 2020; 59 (6): 25052515.CrossRefGoogle Scholar
Wellons, MC, Reklaitis, GV. Optimal Schedule Generation for a Single-Product Production Line. 1. Problem Formulation. Comput Chem Eng. 1989;13(1–2):201212.CrossRefGoogle Scholar
Wellons, MC, Reklaitis, GV. Optimal Schedule Generation for a Single-Product Production Line. 2. Identification of Dominant Unique Path Sequences. Comput Chem Eng. 1989;13(1–2):213227.Google Scholar
Wellons, MC, Reklaitis, GV. Scheduling of Multipurpose Batch Chemical-Plants. 2. Multiple-Product Campaign Formation and Production Planning. Ind Eng Chem Res. 1991;30(4):688705.Google Scholar
Sahinidis, NV, Grossmann, IE. Minlp Model for Cyclic Multiproduct Scheduling on Continuous Parallel Lines. Comput Chem Eng. 1991;15(2):85103.Google Scholar
Pinto, JM, Grossmann, IE. Optimal Cyclic Scheduling of Multistage Continuous Multiproduct Plants. Comput Chem Eng. 1994;18(9):797816.Google Scholar
Schilling, G, Pantelides, CC. Optimal Periodic Scheduling of Multipurpose Plants in the Continuous Time Domain. Comput Chem Eng. 1997;21:S1191S1196.Google Scholar
Castro, PM, Barbosa-Povoa, AP, Novais, AQ. Simultaneous Design and Scheduling of Multipurpose Plants Using Resource Task Network Based Continuous-Time Formulations. Ind Eng Chem Res. 2005;44(2):343357.Google Scholar
Wu, D, Ierapetritou, M. Cyclic Short-Term Scheduling of Multiproduct Batch Plants Using Continuous-Time Representation. Comput Chem Eng. 2004;28(11):22712286.CrossRefGoogle Scholar
Shah, N, Pantelides, CC, Sargent, RWH. Optimal Periodic Scheduling of Multipurpose Batch Plants. Ann. Oper. Res. 1993;42(1):193228.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.CrossRefGoogle Scholar
Dinkelbach, W. On Nonlinear Fractional Programming. Manage Sci. 1967;13(7):492498.CrossRefGoogle Scholar
Pochet, Y, Warichet, F. A Tighter Continuous Time Formulation for the Cyclic Scheduling of a Mixed Plant. Comput Chem Eng. 2008;32(11):27232744.Google Scholar
You, FQ, Castro, PM, Grossmann, IE. Dinkelbach’s Algorithm as an Efficient Method to Solve a Class of MINLP Models for Large-Scale Cyclic Scheduling Problems. Comput Chem Eng. 2009;33(11):18791889.Google Scholar
Flores-Tlacuahuac, A, Grossmann, IE. Simultaneous Cyclic Scheduling and Control of a Multiproduct CSTR. Ind Eng Chem Res. 2006;45(20):66986712.Google Scholar
Moniz, S, Barbosa-Povoa, AP, de Sousa, JP. Simultaneous Regular and Non-regular Production Scheduling of Multipurpose Batch Plants: A Real Chemical-Pharmaceutical Case Study. Comput Chem Eng. 2014;67:83102.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.

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
×