Practical infeasibility of cross-transfer in batch plants with complex recipes: S-graph vs MILP methods

M. Hegyháti, T. Majozi, T. Holczinger, F. Friedler

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

Multipurpose batch processes entail various operational policies that have been widely investigated in published literature. In this paper, no-intermediate-storage (NIS), zero-wait (ZW) and common-intermediate-storage (CIS) operational policies are of particular interest. In all these policies, no dedicated storage facility is available between two consecutive units. Unlike the other operational policies, these particular policies bear some subtle practical infeasibility that has gone unnoticed in literature. In essence, this infeasibility has been reported as optimal, thus assumed to be feasible, by various authors using mathematical programming techniques. It pertains to a unit transferring product to one or more units whilst simultaneously receiving feed from another, which is practically infeasible and as such need not be considered as a possible solution. This feature is particularly conspicuous in batch processes with complex recipes wherein production paths can be in opposite directions. This paper presents the unique feature of the S-graph framework to isolate cross-transfer during optimization, whereas the available mathematical programming methods inherently fail neither to detect nor to eliminate this infeasibility. A few examples taken from published literature are presented for demonstration purposes.

Original languageEnglish
Pages (from-to)605-610
Number of pages6
JournalChemical Engineering Science
Volume64
Issue number3
DOIs
Publication statusPublished - Feb 2009

Fingerprint

Infeasibility
Mixed Integer Linear Programming
Mathematical programming
Batch
Graph in graph theory
Batch Process
Demonstrations
Mathematical Programming
Unit
Consecutive
Eliminate
Policy
Path
Optimization
Zero
Direction compound

Keywords

  • Batch
  • Chemical process
  • Optimization
  • S-graph
  • Scheduling
  • Systems engineering

ASJC Scopus subject areas

  • Chemical Engineering(all)
  • Chemistry(all)
  • Applied Mathematics
  • Industrial and Manufacturing Engineering

Cite this

Practical infeasibility of cross-transfer in batch plants with complex recipes : S-graph vs MILP methods. / Hegyháti, M.; Majozi, T.; Holczinger, T.; Friedler, F.

In: Chemical Engineering Science, Vol. 64, No. 3, 02.2009, p. 605-610.

Research output: Contribution to journalArticle

@article{cf70d3cb9fba4be29249885724f2612d,
title = "Practical infeasibility of cross-transfer in batch plants with complex recipes: S-graph vs MILP methods",
abstract = "Multipurpose batch processes entail various operational policies that have been widely investigated in published literature. In this paper, no-intermediate-storage (NIS), zero-wait (ZW) and common-intermediate-storage (CIS) operational policies are of particular interest. In all these policies, no dedicated storage facility is available between two consecutive units. Unlike the other operational policies, these particular policies bear some subtle practical infeasibility that has gone unnoticed in literature. In essence, this infeasibility has been reported as optimal, thus assumed to be feasible, by various authors using mathematical programming techniques. It pertains to a unit transferring product to one or more units whilst simultaneously receiving feed from another, which is practically infeasible and as such need not be considered as a possible solution. This feature is particularly conspicuous in batch processes with complex recipes wherein production paths can be in opposite directions. This paper presents the unique feature of the S-graph framework to isolate cross-transfer during optimization, whereas the available mathematical programming methods inherently fail neither to detect nor to eliminate this infeasibility. A few examples taken from published literature are presented for demonstration purposes.",
keywords = "Batch, Chemical process, Optimization, S-graph, Scheduling, Systems engineering",
author = "M. Hegyh{\'a}ti and T. Majozi and T. Holczinger and F. Friedler",
year = "2009",
month = "2",
doi = "10.1016/j.ces.2008.10.018",
language = "English",
volume = "64",
pages = "605--610",
journal = "Chemical Engineering Science",
issn = "0009-2509",
publisher = "Elsevier BV",
number = "3",

}

TY - JOUR

T1 - Practical infeasibility of cross-transfer in batch plants with complex recipes

T2 - S-graph vs MILP methods

AU - Hegyháti, M.

AU - Majozi, T.

AU - Holczinger, T.

AU - Friedler, F.

PY - 2009/2

Y1 - 2009/2

N2 - Multipurpose batch processes entail various operational policies that have been widely investigated in published literature. In this paper, no-intermediate-storage (NIS), zero-wait (ZW) and common-intermediate-storage (CIS) operational policies are of particular interest. In all these policies, no dedicated storage facility is available between two consecutive units. Unlike the other operational policies, these particular policies bear some subtle practical infeasibility that has gone unnoticed in literature. In essence, this infeasibility has been reported as optimal, thus assumed to be feasible, by various authors using mathematical programming techniques. It pertains to a unit transferring product to one or more units whilst simultaneously receiving feed from another, which is practically infeasible and as such need not be considered as a possible solution. This feature is particularly conspicuous in batch processes with complex recipes wherein production paths can be in opposite directions. This paper presents the unique feature of the S-graph framework to isolate cross-transfer during optimization, whereas the available mathematical programming methods inherently fail neither to detect nor to eliminate this infeasibility. A few examples taken from published literature are presented for demonstration purposes.

AB - Multipurpose batch processes entail various operational policies that have been widely investigated in published literature. In this paper, no-intermediate-storage (NIS), zero-wait (ZW) and common-intermediate-storage (CIS) operational policies are of particular interest. In all these policies, no dedicated storage facility is available between two consecutive units. Unlike the other operational policies, these particular policies bear some subtle practical infeasibility that has gone unnoticed in literature. In essence, this infeasibility has been reported as optimal, thus assumed to be feasible, by various authors using mathematical programming techniques. It pertains to a unit transferring product to one or more units whilst simultaneously receiving feed from another, which is practically infeasible and as such need not be considered as a possible solution. This feature is particularly conspicuous in batch processes with complex recipes wherein production paths can be in opposite directions. This paper presents the unique feature of the S-graph framework to isolate cross-transfer during optimization, whereas the available mathematical programming methods inherently fail neither to detect nor to eliminate this infeasibility. A few examples taken from published literature are presented for demonstration purposes.

KW - Batch

KW - Chemical process

KW - Optimization

KW - S-graph

KW - Scheduling

KW - Systems engineering

UR - http://www.scopus.com/inward/record.url?scp=58149279273&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=58149279273&partnerID=8YFLogxK

U2 - 10.1016/j.ces.2008.10.018

DO - 10.1016/j.ces.2008.10.018

M3 - Article

AN - SCOPUS:58149279273

VL - 64

SP - 605

EP - 610

JO - Chemical Engineering Science

JF - Chemical Engineering Science

SN - 0009-2509

IS - 3

ER -