Date of Original Version

12-25-2012

Type

Article

Rights Management

This document is the unedited Author’s version of a Submitted Work that was subsequently accepted for publication , copyright © American Chemical Society after peer review. To access the final edited and published work see http://dx.doi.org/10.1021/ie302788g

Abstract or Description

Motivated by a real-world industrial problem, this work deals with the integration of planning and scheduling in the operation of a network of batch plants. The network consists of single-stage, multiproduct batch plants located in different sites, which can exchange intermediate products in order to blend them to obtain finished products. The time horizon is given and divided into multiple time periods, at the end of which, the customer demands have to be exactly satisfied. The planning model is a simplified and aggregate formulation derived from the detailed precedence-based scheduling formulation. Traveling Salesman Problem (TSP) constraints are incorporated at the planning level in order to predict the sequence-dependent changeovers between groups of products, within and across time periods, without requiring the detailed timing of operations, which is performed at the scheduling level. In an effort to avoid solving the full-space, rigorous scheduling model, especially for large problem sizes, two decomposition strategies are investigated: Bilevel and Temporal Lagrangean. We demonstrate that Bilevel Decomposition is efficient for small to medium problem instances and that further decomposition of the planning problem, yielding a hybrid decomposition scheme, is advantageous for tackling a large-scale industrial test case.

DOI

10.1021/ie302788g

Share

COinS
 

Published In

Industrial and Engineering Chemistry Research, 52, 5, 2152-2167.