Chemical production scheduling mixed-integer programming models and methods Christos T. Maravelias

Format:

Book

Author/Creator:

Maravelias, Christos, 1973- author.

Series:

Cambridge series in chemical engineering

Language:

English

Subjects (All):

Chemical plants--Management.

Chemical plants.

Chemical engineering.

Production scheduling.

Chemical Engineering.

chemical engineering.

Medical Subjects:

Chemical Engineering.

Physical Description:

1 online resource

Place of Publication:

Cambridge, United Kingdom New York, NY Cambridge University Press 2021

Summary:

"Understand common scheduling as well as other advanced operational problems with this valuable reference from a recognized leader in the field. Beginning with basic principles and an overview of linear and mixed-integer programming, this unified treatment introduces the fundamental ideas underpinning most modeling approaches, and will allow you to easily develop your own models. With more than 150 figures, the basic concepts and ideas behind the development of different approaches are clearly illustrated. Addresses a wide range of problems arising in diverse industrial sectors, from oil and gas to fine chemicals, and from commodity chemicals to food manufacturing. A perfect resource for engineering and computer science students, researchers working in the area, and industrial practitioners"-- Provided by publisher

Contents:

Cover

Half-title

Series information

Title page

Copyright information

Dedication

Contents

Preface

Background and Motivation

Audience

Organization

Approach

Online Resources

Acknowledgments

Part I Background

1 Introduction

1.1 Preliminaries

1.1.1 Scheduling: Applications and Definition

1.1.2 Some Simple Problems

1.1.3 Scheduling in the Supply Chain

1.1.4 Interactions with Other Planning Functions

1.1.5 Scheduling in the Process Industries

1.1.6 General Problem Statement

1.2 Chemical Production Environments

1.2.1 Discrete Manufacturing Machine Environments

1.2.2 Critical Insights

1.2.3 Sequential Environments

1.2.4 Network Environments

1.2.5 General Environments

1.3 Classes of Problems

1.3.1 Production Environments (?)

1.3.2 Processing Restrictions and Features (?)

1.3.3 Objective Functions (?)

1.3.4 Problem Classification

1.4 Approaches to Scheduling

1.4.1 Problem-Specific Algorithms

1.4.2 Metaheuristics

1.4.3 Integrated Modeling/Solution Approaches

1.4.4 Mathematical Programming

1.4.5 Hybrid Methods

1.5 Scheduling MIP Model Classification

1.6 Book Outline

1.7 Notes and Further Reading

References

2 Mixed-Integer Programming

2.1 Preliminaries

2.1.1 General Optimization Problem

2.1.2 General Mixed-Integer Programming Problem

2.1.3 Graphs and Networks

2.2 Modeling with Binary Variables

2.2.1 Logic Conditions

2.2.2 Nonlinear Functions

2.2.3 Disjunctions

2.3 Basic Integer Programming Problems

2.3.1 Knapsack

2.3.2 Assignment

2.3.3 Traveling Salesman

2.3.4 Set Covering

2.3.5 Production Planning

2.3.6 Facility Location

2.3.7 Network Problems

2.4 Solution Methods

2.4.1 Branch-and-Bound Algorithm

2.4.2 Cutting Planes

2.4.3 Reformulations

2.4.4 Decomposition Methods

2.5 Software Tools

2.5.1 Modeling Languages

2.5.2 Solvers

2.6 Notes and Further Reading

2.7 Exercises

Part II Basic Methods

3 Single-Unit Environment

3.1 Problem Statement

3.2 Sequence-Based Models

3.2.1 Global Sequence Models

3.2.2 Immediate Sequence Models

3.3 Models Based on a Continuous Time Grid

3.4 Models Based on a Discrete Time Grid

3.5 Extensions

3.5.1 Prize Collection Problem

3.5.2 Product Families

3.6 Remarks

3.6.1 Assumptions

3.6.2 Variable Fixing

3.6.3 Alternative Models

3.6.4 Model Size

3.6.5 Problem-Specific versus General Models

3.6.6 Recommendations

3.7 Notes and Further Reading

3.8 Exercises

4 Single-Stage Environment

4.1 Problem Statement

4.2 Sequence-Based Models

4.3 Models Based on a Continuous Time Grid

4.4 Models Based on a Discrete Time Grid

4.5 Batching Decisions

4.5.1 Sequence-Based Models

4.5.2 Model Based on a Continuous Time Grid

4.5.3 Model Based on a Discrete Time Grid

4.6 General Shared Resources

4.6.1 Preliminaries

4.6.2 Sequence-Based Models

4.6.3 Models Based on a Common Continuous Time Grid

4.6.4 Models Based on a Discrete Time Grid

4.7 General Shared Resources: Extensions

4.7.1 Time-Varying Resource Capacity and Cost

4.7.2 Varying Resource Consumption during Batch Execution

4.8 Notes and Further Reading

4.9 Exercises

5 Multistage Environment

5.1 Problem Statement

5.2 Sequence-Based Models

5.3 Models Based on a Continuous Time Grid

5.4 Models Based on a Discrete Time Grid

5.5 Storage Constraints

5.5.1 Preliminaries

5.5.2 Problem Statement

5.5.3 Basic Sequence-Based Model

5.5.4 Modifications and Extensions

5.6 Notes and Further Reading

5.7 Exercises

6 Multipurpose Environment

6.1 Problem Statement

6.2 Sequence-Based Model

6.3 Model Based on a Continuous Time Grid

6.4 Models Based on a Discrete Time Grid

6.5 Notes and Further Reading

6.6 Exercises

7 Network Environment: Basics

7.1 Problem Representation

7.1.1 State-Task Network

7.1.2 Resource-Task Network

7.2 Models Based on a Discrete Time Grid

7.2.1 Intermediate Shipments and Time-Varying Utility Capacity and Pricing

7.2.2 STN-Based Models

7.2.3 RTN-Based Models

7.2.4 Interpretation of Backlogs and Lost Sales

7.3 Models Based on a Common Continuous Time Grid

7.3.1 Basic Model

7.3.2 Extensions

7.3.3 Remarks

7.4 Notes and Further Reading

7.5 Exercises

Part III Advanced Methods

8 Network Environment: Extensions

8.1 Material Consumption and Production during Task Execution

8.2 Material Storage and Transfer

8.2.1 Storage in Shared Vessels

8.2.2 Storage in Processing Units and Material Flows

8.2.3 Material Storage Extensions

8.2.4 Material Transfer Tasks

8.3 Setups and Task Families

8.3.1 Unit Setups

8.3.2 Task Setups

8.3.3 Task Families

8.4 Unit Deterioration and Maintenance

8.4.1 No Effect on Capacity and Conversion

8.4.2 Unit Capacity Reduction

8.4.3 Conversion Reduction

8.5 Notes and Further Reading

9 Continuous Processes

9.1 Preliminaries

9.1.1 Background

9.1.2 Batch versus Continuous Processing

9.2 Basic Model

9.3 Extensions

9.3.1 Startups and Shutdowns

9.3.2 Transitions between Steady States

9.3.3 Time Delays

9.3.4 General Startups and Shutdowns with Time Delays

9.3.5 General Transitions

9.4 Notes and Further Reading

9.5 Exercises

10 Periodic Scheduling

10.1 Single-Unit Environment

10.1.1 Problem Statement

10.1.2 Preliminaries and Motivation

10.1.3 Notation

10.1.4 Basic Discrete Time Model

10.1.5 Advanced Discrete Time Model

10.1.6 Remarks

10.2 Single-Stage Environment

10.2.1 Problem Statement

10.2.2 Basic Model

10.2.3 Shipments at Specified Times

10.2.4 Simplifying Assumptions and Solution Features

10.2.5 Unit-Specific Solutions

10.2.6 Continuous Time Models: Basics

10.2.7 Continuous Processing: Basics

10.3 Network Environment

10.3.1 Problem Statement

10.3.2 Model

10.4 Notes and Further Reading

10.5 Exercises

11 Multiperiod Blending

11.1 Preliminaries

11.1.1 Pooling

11.1.2 Pooling Formulations

11.1.3 Product Blending

11.2 Product Blending: Nonlinear Models

11.2.1 Concentration-Based Model

11.2.2 Source-Based Model

11.2.3 Remarks and Extensions

11.3 Product Blending: Linear Approximate Models

11.3.1 Discretization-Based Model

11.3.2 Discretization-Relaxation-Based Model

11.4 Process Blending

11.4.1 Problem Statement

11.4.2 Basic Model

11.4.3 Illustrative Example

11.4.4 Extensions

11.5 Notes and Further Reading

11.6 Exercises

Part IV Special Topics

12 Solution Methods: Sequential Environments

12.1 Decomposition Methods

12.1.1 Preliminaries

12.1.2 Single-Stage Environment: Cost Minimization

12.1.3 Multistage Environment: Cost Minimization

12.1.4 Makespan Minimization

12.1.5 Remarks and Extensions

12.2 Tightening and Preprocessing

12.2.1 Tightening Based on Batch-Unit Assignments: Single-Stage

12.2.2 Tightening Based on Batch-Unit Assignments: Multistage

12.2.3 Fixing Sequencing Binary Variables: Multistage

12.3 A Reformulation and Tightening Based on Variable Time Windows

12.4 Discrete-Continuous Algorithm

12.5 Notes and Further Reading

12.6 Exercises

13 Solution Methods: Network Environments

13.1 Background and Motivation

13.1.1 Problem Statement

13.1.2 Basic STN-Based Model

13.1.3 Motivating Examples

13.2 Preprocessing and Tightening

13.2.1 General Networks

13.2.2 Networks with Loops

13.2.3 Preprocessing Algorithm

13.2.4 Valid Inequalities

13.2.5 Extensions

13.3 Reformulations

13.3.1 New Variables and Branching Strategies

13.3.2 Remarks

13.4 Models Based on Multiple Discrete Time Grids

13.4.1 Time Windows

13.4.2 Exact Task and Unit Time Discretization

13.4.3 Approximate Task and Unit Time Discretization

13.4.4 Material Grids

13.4.5 Model

13.4.6 Types of Time Grids

13.5 Discrete-Continuous Algorithm

13.5.1 Preliminaries and Outline

13.5.2 Mapping

13.5.3 Third-Stage Linear Programming Model

13.5.4 Extensions

13.6 Notes and Further Reading

13.7 Exercises

14 Real-Time Scheduling

14.1 Motivation and Background

14.1.1 Uncertainty versus New Information

14.1.2 Event Triggered versus Periodic Rescheduling

14.1.3 Notation

14.1.4 Approach Classification

14.2 State-Space Scheduling Model

14.2.1 Preliminaries

14.2.2 Basic Model

14.2.3 Modeling of Disturbances

14.2.4 Extensions

14.3 Design of Real-Time Scheduling Algorithm

14.3.1 Algorithmic Parameters

14.3.2 System Characteristics

14.3.3 Design through Simulation: Deterministic Case

14.3.4 Model Modifications

14.3.5 Design through Simulation: Stochastic Case

14.3.6 Integrated Framework

14.4 Feedback through Integration with Other Functions

14.4.1 Integration with Automation Logic

14.4.2 Integration with Process Control

14.5 Notes and Further Reading

14.6 Exercises

15 Integration of Production Planning and Scheduling

15.1 Preliminaries

15.1.1 Production Planning

15.1.2 Motivation

15.1.3 Lot Sizing

Notes:

Includes bibliographical references and index

Description based on online resource; title from digital title page (viewed on June 08, 2021)

Other Format:

Print version Maravelias, Christos, 1973- Chemical production scheduling

ISBN:

9781316650998

1316650995

OCLC:

1195820001

Access Restriction:

Restricted for use by site license