Scheduling Intermediate Storage Multipurpose Batch Plants Using the S-Graph

Javier Romero, Luis Puigjaner, Tibor Holczinger, F. Friedler

Research output: Contribution to journalArticle

24 Citations (Scopus)

Abstract

A graph theoretical approach is proposed for the optimal scheduling of multipurpose batch plants when constraints on intermediate storage allocation are met. The novel S-graph representation is extended and combined with a set of rationales to consider intermediate storage policy in production scheduling. This set of rationales accelerates the optimization procedure, reducing the searching tree from the very beginning, without losing optimality. It is assumed that the storage units can be commonly used throughout the plant to achieve maximum plant flexibility. Therefore, the problem solved suggests the more general batch-process transfer strategy, common intermediate storage policy (CIS). This policy is suggested for more flexible use of intermediate storage units. The accuracy of this proposed algorithm is tested with an exhaustive B&B search algorithm. The methodology is compared with other CIS algorithms and is applied to solve several case studies. The benefits of considering this kind of storage coupled with the use of the proposed algorithm are discussed through motivating examples.

Original languageEnglish
Pages (from-to)403-417
Number of pages15
JournalAICHE Journal
Volume50
Issue number2
DOIs
Publication statusPublished - Feb 2004

Fingerprint

Scheduling

Keywords

  • CIS
  • FIS
  • Intermediate storage
  • Schedule-graph
  • Scheduling

ASJC Scopus subject areas

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

Cite this

Scheduling Intermediate Storage Multipurpose Batch Plants Using the S-Graph. / Romero, Javier; Puigjaner, Luis; Holczinger, Tibor; Friedler, F.

In: AICHE Journal, Vol. 50, No. 2, 02.2004, p. 403-417.

Research output: Contribution to journalArticle

Romero, Javier ; Puigjaner, Luis ; Holczinger, Tibor ; Friedler, F. / Scheduling Intermediate Storage Multipurpose Batch Plants Using the S-Graph. In: AICHE Journal. 2004 ; Vol. 50, No. 2. pp. 403-417.
@article{6529d72949f84a5b9c1f827f973a6083,
title = "Scheduling Intermediate Storage Multipurpose Batch Plants Using the S-Graph",
abstract = "A graph theoretical approach is proposed for the optimal scheduling of multipurpose batch plants when constraints on intermediate storage allocation are met. The novel S-graph representation is extended and combined with a set of rationales to consider intermediate storage policy in production scheduling. This set of rationales accelerates the optimization procedure, reducing the searching tree from the very beginning, without losing optimality. It is assumed that the storage units can be commonly used throughout the plant to achieve maximum plant flexibility. Therefore, the problem solved suggests the more general batch-process transfer strategy, common intermediate storage policy (CIS). This policy is suggested for more flexible use of intermediate storage units. The accuracy of this proposed algorithm is tested with an exhaustive B&B search algorithm. The methodology is compared with other CIS algorithms and is applied to solve several case studies. The benefits of considering this kind of storage coupled with the use of the proposed algorithm are discussed through motivating examples.",
keywords = "CIS, FIS, Intermediate storage, Schedule-graph, Scheduling",
author = "Javier Romero and Luis Puigjaner and Tibor Holczinger and F. Friedler",
year = "2004",
month = "2",
doi = "10.1002/aic.10036",
language = "English",
volume = "50",
pages = "403--417",
journal = "AICHE Journal",
issn = "0001-1541",
publisher = "American Institute of Chemical Engineers",
number = "2",

}

TY - JOUR

T1 - Scheduling Intermediate Storage Multipurpose Batch Plants Using the S-Graph

AU - Romero, Javier

AU - Puigjaner, Luis

AU - Holczinger, Tibor

AU - Friedler, F.

PY - 2004/2

Y1 - 2004/2

N2 - A graph theoretical approach is proposed for the optimal scheduling of multipurpose batch plants when constraints on intermediate storage allocation are met. The novel S-graph representation is extended and combined with a set of rationales to consider intermediate storage policy in production scheduling. This set of rationales accelerates the optimization procedure, reducing the searching tree from the very beginning, without losing optimality. It is assumed that the storage units can be commonly used throughout the plant to achieve maximum plant flexibility. Therefore, the problem solved suggests the more general batch-process transfer strategy, common intermediate storage policy (CIS). This policy is suggested for more flexible use of intermediate storage units. The accuracy of this proposed algorithm is tested with an exhaustive B&B search algorithm. The methodology is compared with other CIS algorithms and is applied to solve several case studies. The benefits of considering this kind of storage coupled with the use of the proposed algorithm are discussed through motivating examples.

AB - A graph theoretical approach is proposed for the optimal scheduling of multipurpose batch plants when constraints on intermediate storage allocation are met. The novel S-graph representation is extended and combined with a set of rationales to consider intermediate storage policy in production scheduling. This set of rationales accelerates the optimization procedure, reducing the searching tree from the very beginning, without losing optimality. It is assumed that the storage units can be commonly used throughout the plant to achieve maximum plant flexibility. Therefore, the problem solved suggests the more general batch-process transfer strategy, common intermediate storage policy (CIS). This policy is suggested for more flexible use of intermediate storage units. The accuracy of this proposed algorithm is tested with an exhaustive B&B search algorithm. The methodology is compared with other CIS algorithms and is applied to solve several case studies. The benefits of considering this kind of storage coupled with the use of the proposed algorithm are discussed through motivating examples.

KW - CIS

KW - FIS

KW - Intermediate storage

KW - Schedule-graph

KW - Scheduling

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

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

U2 - 10.1002/aic.10036

DO - 10.1002/aic.10036

M3 - Article

AN - SCOPUS:1642291892

VL - 50

SP - 403

EP - 417

JO - AICHE Journal

JF - AICHE Journal

SN - 0001-1541

IS - 2

ER -