Book contents
- Chemical Production Scheduling
- Cambridge Series in Chemical Engineering
- Chemical Production Scheduling
- Copyright page
- Dedication
- Contents
- Preface
- Part I Background
- Part II Basic Methods
- 3 Single-Unit Environment
- 4 Single-Stage Environment
- 5 Multistage Environment
- 6 Multipurpose Environment
- 7 Network Environment: Basics
- Part III Advanced Methods
- Part IV Special Topics
- Index
- References
7 - Network Environment: Basics
from Part II - Basic Methods
Published online by Cambridge University Press: 01 May 2021
Book contents
- Chemical Production Scheduling
- Cambridge Series in Chemical Engineering
- Chemical Production Scheduling
- Copyright page
- Dedication
- Contents
- Preface
- Part I Background
- Part II Basic Methods
- 3 Single-Unit Environment
- 4 Single-Stage Environment
- 5 Multistage Environment
- 6 Multipurpose Environment
- 7 Network Environment: Basics
- Part III Advanced Methods
- Part IV Special Topics
- Index
- References
Summary
In this chapter, we discuss scheduling in network environments that are unique in the process industries. We study the basic features of this class of problems, including tasks consuming and producing multiple materials, shared utilities, and time-varying utility cost and capacity. In the next chapter, we will consider additional features, including material consumption and production during batch execution, material transfer activities, and unit deterioration. Problems in sequential environments can be expressed using the traditional representation based on batches (orders), stages (operations), and units (machines). This representation is insufficient for problems in network environments. Thus, we start in Section 7.1 with two frameworks, the so-called state-task network (STN) and resource-task network (RTN), for problem representation and the corresponding problem statements. In Section 7.2, we present two models based on a common discrete time grid, and in Section 7.3 we present a model based on a common continuous time grid.
Keywords
Information
- Type
- Chapter
- Information
- Chemical Production SchedulingMixed-Integer Programming Models and Methods, pp. 157 - 190Publisher: Cambridge University PressPrint publication year: 2021
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):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 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:S703–S708.Google 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):259–280.CrossRefGoogle 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:S577–S582.Google Scholar
Schilling, G, Pantelides, CC. A Simple Continuous-Time Process Scheduling Formulation and a Novel Solution Algorithm. Comput Chem Eng. 1996;20:S1221–S1226.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):897–904.Google Scholar
Zhang, XY, Sargent, RWH. The Optimal Operation of Mixed Production Facilities – Extensions and Improvements. Comput Chem Eng. 1996;20:S1287–S1293.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):197–203.CrossRefGoogle 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):204–210.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):4902–4911.CrossRefGoogle 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):2059–2068.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):2679–2702.Google 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):1644–1660.CrossRefGoogle 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):1511–1528.CrossRefGoogle Scholar
Ierapetritou, MG, Floudas, CA. Effective Continuous-Time Formulation for Short-Term Scheduling. 1. Multipurpose Batch Processes. Ind Eng Chem Res. 1998;37(11):4341–4359.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):4360–4374.CrossRefGoogle 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):2431–2439.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):2178–2184.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):2516–2533.CrossRefGoogle 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):913–955.Google Scholar
Susarla, N, Li, J, Karimi, IA. A Novel Approach to Scheduling Multipurpose Batch Plants Using Unit-Slots. AlChE J. 2010;56(7):1859–1879.Google Scholar
Maravelias, CT. Mixed-Time Representation for State-Task Network Models. Ind Eng Chem Res. 2005;44(24):9129–9145.CrossRefGoogle Scholar
Kelly, JD, Zyngier, D. Unit-Operation Nonlinear Modeling for Planning and Scheduling Applications. Optimization and Engineering. 2017;18(1):133–154.Google Scholar
Zyngier, D, Kelly, JD. Multiproduct Inventory Logistics Modeling in the Process Industries. Springer Ser Optim A. 2009;30:61–95.Google Scholar
Sundaramoorthy, A, Maravelias, CT. A General Framework for Process Scheduling. AlChE J. 2011;57(3):695–710.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):3407–3423.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):5023–5040.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
Accessibility standard: Unknown
Why this information is here
This section outlines the accessibility features of this content - including support for screen readers, full keyboard navigation and high-contrast display options. This may not be relevant for you.Accessibility Information
Accessibility compliance for the HTML of this chapter is currently unknown
and may be updated in the future.