Approximation Algorithms for Process Systems Engineering

  title={Approximation Algorithms for Process Systems Engineering},
  author={Dimitrios Letsios and Radu Baltean-Lugojan and Francesco Ceccon and Miten Mistry and Johannes Wiebe and Ruth Misener},
Designing and analyzing algorithms with provable performance guarantees enables efficient optimization problem solving in different application domains, e.g.\ communication networks, transportation, economics, and manufacturing. Despite the significant contributions of approximation algorithms in engineering, only limited and isolated works contribute from this perspective in process systems engineering. The current paper discusses three representative, NP-hard problems in process systems… 
Solving the pooling problem at scale with extensible solver GALINI
This paper presents a Python library to model pooling problems, a class of network flow problems with many engineering applications. The library automatically generates a mixed-integer
Approximate and robust bounded job start scheduling for Royal Mail delivery offices
This work explores the idea of scheduling long jobs in parallel with short jobs to obtain tightly satisfied packing and bounded job start constraints and shows that LPT is 5/3-approximate for the former and optimal for the latter.


A simulation-based optimization framework for integrating scheduling and model predictive control, and its application to air separation units
This work proposes a novel framework for the integration of scheduling and model predictive control (MPC), which is applicable to industrial size problems involving fast changing market conditions and shows that significant cost reductions can be achieved with reasonable computational times.
Optimal heat exchanger network synthesis: A case study comparison
Abstract Heat exchanger network synthesis (HENS) is one of the most extensively studied synthesis/design problem in chemical engineering. This is attributed to the importance of determining energy
Decomposition approaches for the efficient solution of short-term scheduling problems
An iterative solution framework is proposed that exploits the lower bound obtained through the heuristic-based approaches and the upper bound based on the LR and LD to result in a refined schedule for large-scale scheduling problems.
Combining the advantages of discrete- and continuous-time scheduling models: Part 1. Framework and mathematical formulations
The proposed method takes advantage of the complementary strengths of discrete- and continuous-time formulations, which enables it to not only handle various processing features, but also obtain order of magnitude speedups in the solution of large-scale instances.
A structural optimization approach in process synthesis
A strategy based on mixed-integer programming is proposed for the optimal synthesis of total processing systems that consist of a chemical plant, with its heat recovery network and utility system. A
Heuristics with Performance Guarantees for the Minimum Number of Matches Problem in Heat Recovery Network Design
This work develops heuristic methods with performance guarantees using three approaches: (i) relaxation rounding, (ii) water filling, and (iii) greedy packing for a single temperature interval.
Evaluation of the Complexity, Controllability and Observability of Heat Exchanger Networks Based on Structural Analysis of Network Representations
The design and retrofit of Heat Exchanger Networks (HENs) can be based on several objectives and optimisation algorithms. As each method results in an individual network topology that has a
On the design of online production scheduling algorithms
A systematic way to design online scheduling algorithms to achieve better closed-loop performance is discussed, and the role of demand uncertainty is evaluated and how it can be mitigated through better tuning of the above algorithmic parameters.
Scope for industrial applications of production scheduling models and solution methods
The aim of the paper is to focus on the industrial aspects of scheduling and discuss the main characteristics, including strengths and weaknesses of the presented approaches, as well as some lessons learned from industry.
A general algorithm for short-term scheduling of batch operations—II. Computational issues
Abstract The first part of this paper (p. 211) presented a general mathematical framework for describing a wide variety of scheduling problems arising in multiproduct/multipurpose batch chemical