Combinatorial framework for effective scheduling of multipurpose batch plants

E. Sanmartí, L. Puigjaner, T. Holczinger, F. Friedler

Research output: Contribution to journalArticle

51 Citations (Scopus)

Abstract

The production scheduling of multipurpose batch plants is considered. A novel graph representation that looks at the specific characteristics of production scheduling in chemical processes is proposed. In these graphs, the nodes represent the production tasks, the arcs of the precedence relationships among them. The representation is flexible enough to consider a wide variety of production structures, including complex recipes. Both nonintermediate storage (NIS) and unlimited intermediate storage (UIS) transfer policies can be considered simply by choosing the appropriate precedence relationships. This representation provides the opportunity of incorporating highly efficient graph algorithms together with an appropriate branch-and-bound algorithm for solving multipurpose scheduling problems. The efficiency of the proposed method is established by solving examples and a complex case study.

Original languageEnglish
Pages (from-to)2557-2570
Number of pages14
JournalAICHE Journal
Volume48
Issue number11
DOIs
Publication statusPublished - Nov 1 2002

Fingerprint

Chemical Phenomena
Scheduling

ASJC Scopus subject areas

  • Biotechnology
  • Chemical Engineering(all)
  • Mechanical Engineering
  • Environmental Engineering
  • Polymers and Plastics

Cite this

Combinatorial framework for effective scheduling of multipurpose batch plants. / Sanmartí, E.; Puigjaner, L.; Holczinger, T.; Friedler, F.

In: AICHE Journal, Vol. 48, No. 11, 01.11.2002, p. 2557-2570.

Research output: Contribution to journalArticle

Sanmartí, E. ; Puigjaner, L. ; Holczinger, T. ; Friedler, F. / Combinatorial framework for effective scheduling of multipurpose batch plants. In: AICHE Journal. 2002 ; Vol. 48, No. 11. pp. 2557-2570.
@article{630349ddd726419d8b12f750e403ad80,
title = "Combinatorial framework for effective scheduling of multipurpose batch plants",
abstract = "The production scheduling of multipurpose batch plants is considered. A novel graph representation that looks at the specific characteristics of production scheduling in chemical processes is proposed. In these graphs, the nodes represent the production tasks, the arcs of the precedence relationships among them. The representation is flexible enough to consider a wide variety of production structures, including complex recipes. Both nonintermediate storage (NIS) and unlimited intermediate storage (UIS) transfer policies can be considered simply by choosing the appropriate precedence relationships. This representation provides the opportunity of incorporating highly efficient graph algorithms together with an appropriate branch-and-bound algorithm for solving multipurpose scheduling problems. The efficiency of the proposed method is established by solving examples and a complex case study.",
author = "E. Sanmart{\'i} and L. Puigjaner and T. Holczinger and F. Friedler",
year = "2002",
month = "11",
day = "1",
doi = "10.1002/aic.690481115",
language = "English",
volume = "48",
pages = "2557--2570",
journal = "AICHE Journal",
issn = "0001-1541",
publisher = "American Institute of Chemical Engineers",
number = "11",

}

TY - JOUR

T1 - Combinatorial framework for effective scheduling of multipurpose batch plants

AU - Sanmartí, E.

AU - Puigjaner, L.

AU - Holczinger, T.

AU - Friedler, F.

PY - 2002/11/1

Y1 - 2002/11/1

N2 - The production scheduling of multipurpose batch plants is considered. A novel graph representation that looks at the specific characteristics of production scheduling in chemical processes is proposed. In these graphs, the nodes represent the production tasks, the arcs of the precedence relationships among them. The representation is flexible enough to consider a wide variety of production structures, including complex recipes. Both nonintermediate storage (NIS) and unlimited intermediate storage (UIS) transfer policies can be considered simply by choosing the appropriate precedence relationships. This representation provides the opportunity of incorporating highly efficient graph algorithms together with an appropriate branch-and-bound algorithm for solving multipurpose scheduling problems. The efficiency of the proposed method is established by solving examples and a complex case study.

AB - The production scheduling of multipurpose batch plants is considered. A novel graph representation that looks at the specific characteristics of production scheduling in chemical processes is proposed. In these graphs, the nodes represent the production tasks, the arcs of the precedence relationships among them. The representation is flexible enough to consider a wide variety of production structures, including complex recipes. Both nonintermediate storage (NIS) and unlimited intermediate storage (UIS) transfer policies can be considered simply by choosing the appropriate precedence relationships. This representation provides the opportunity of incorporating highly efficient graph algorithms together with an appropriate branch-and-bound algorithm for solving multipurpose scheduling problems. The efficiency of the proposed method is established by solving examples and a complex case study.

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

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

U2 - 10.1002/aic.690481115

DO - 10.1002/aic.690481115

M3 - Article

AN - SCOPUS:0036877332

VL - 48

SP - 2557

EP - 2570

JO - AICHE Journal

JF - AICHE Journal

SN - 0001-1541

IS - 11

ER -