Superstructure Approach to Batch Process Scheduling by S-graph Representation

B. Bertók, R. Adonyi, F. Friedler, L. T. Fan

Research output: Book/ReportBook

4 Citations (Scopus)

Abstract

Scheduling plays a key role in batch process operation; it has a major effect on the process' performance. Available methods for determining the optimal schedule are primarily based on either MILP/MINLP formulation in conjunction with mathematical programming (Floudas and Lin, 2004; Vaklieva-Bancheva and Kirilova, 2010) or graph representation in conjunction with combinatorial algorithms (Sanmarti et al., 2002).The current work comprises three major contributions. First, an algorithm has been crafted to generate a superstructure for a scheduling problem. The problem is defined in the form of an S-graph representing the recipe. The superstructure contains exclusively every step potentially performed by any of the functional or operating facilities or equipment units capable of completing at least one task to be scheduled. These steps involve executions of tasks and changeovers from one task to another. Second, an MILP formulation is elaborated on the basis of the superstructure, which guarantees the optimal solution of the scheduling problem. Third, a relaxation of the MILP model is incorporated into the S-graph algorithms to support the selection of subproblems and decision variables in the branch-and-bound procedure.

Original languageEnglish
PublisherUnknown Publisher
Number of pages5
Volume29
DOIs
Publication statusPublished - 2011

Publication series

NameComputer Aided Chemical Engineering
Volume29
ISSN (Print)15707946

Fingerprint

Scheduling
Mathematical programming

Keywords

  • MILP
  • S-graph
  • Scheduling
  • Superstructure

ASJC Scopus subject areas

  • Chemical Engineering(all)
  • Computer Science Applications

Cite this

Bertók, B., Adonyi, R., Friedler, F., & Fan, L. T. (2011). Superstructure Approach to Batch Process Scheduling by S-graph Representation. (Computer Aided Chemical Engineering; Vol. 29). Unknown Publisher. https://doi.org/10.1016/B978-0-444-53711-9.50221-2

Superstructure Approach to Batch Process Scheduling by S-graph Representation. / Bertók, B.; Adonyi, R.; Friedler, F.; Fan, L. T.

Unknown Publisher, 2011. 5 p. (Computer Aided Chemical Engineering; Vol. 29).

Research output: Book/ReportBook

Bertók, B, Adonyi, R, Friedler, F & Fan, LT 2011, Superstructure Approach to Batch Process Scheduling by S-graph Representation. Computer Aided Chemical Engineering, vol. 29, vol. 29, Unknown Publisher. https://doi.org/10.1016/B978-0-444-53711-9.50221-2
Bertók, B. ; Adonyi, R. ; Friedler, F. ; Fan, L. T. / Superstructure Approach to Batch Process Scheduling by S-graph Representation. Unknown Publisher, 2011. 5 p. (Computer Aided Chemical Engineering).
@book{94acb13a1946474ea1e2d2d08c26f27f,
title = "Superstructure Approach to Batch Process Scheduling by S-graph Representation",
abstract = "Scheduling plays a key role in batch process operation; it has a major effect on the process' performance. Available methods for determining the optimal schedule are primarily based on either MILP/MINLP formulation in conjunction with mathematical programming (Floudas and Lin, 2004; Vaklieva-Bancheva and Kirilova, 2010) or graph representation in conjunction with combinatorial algorithms (Sanmarti et al., 2002).The current work comprises three major contributions. First, an algorithm has been crafted to generate a superstructure for a scheduling problem. The problem is defined in the form of an S-graph representing the recipe. The superstructure contains exclusively every step potentially performed by any of the functional or operating facilities or equipment units capable of completing at least one task to be scheduled. These steps involve executions of tasks and changeovers from one task to another. Second, an MILP formulation is elaborated on the basis of the superstructure, which guarantees the optimal solution of the scheduling problem. Third, a relaxation of the MILP model is incorporated into the S-graph algorithms to support the selection of subproblems and decision variables in the branch-and-bound procedure.",
keywords = "MILP, S-graph, Scheduling, Superstructure",
author = "B. Bert{\'o}k and R. Adonyi and F. Friedler and Fan, {L. T.}",
year = "2011",
doi = "10.1016/B978-0-444-53711-9.50221-2",
language = "English",
volume = "29",
series = "Computer Aided Chemical Engineering",
publisher = "Unknown Publisher",

}

TY - BOOK

T1 - Superstructure Approach to Batch Process Scheduling by S-graph Representation

AU - Bertók, B.

AU - Adonyi, R.

AU - Friedler, F.

AU - Fan, L. T.

PY - 2011

Y1 - 2011

N2 - Scheduling plays a key role in batch process operation; it has a major effect on the process' performance. Available methods for determining the optimal schedule are primarily based on either MILP/MINLP formulation in conjunction with mathematical programming (Floudas and Lin, 2004; Vaklieva-Bancheva and Kirilova, 2010) or graph representation in conjunction with combinatorial algorithms (Sanmarti et al., 2002).The current work comprises three major contributions. First, an algorithm has been crafted to generate a superstructure for a scheduling problem. The problem is defined in the form of an S-graph representing the recipe. The superstructure contains exclusively every step potentially performed by any of the functional or operating facilities or equipment units capable of completing at least one task to be scheduled. These steps involve executions of tasks and changeovers from one task to another. Second, an MILP formulation is elaborated on the basis of the superstructure, which guarantees the optimal solution of the scheduling problem. Third, a relaxation of the MILP model is incorporated into the S-graph algorithms to support the selection of subproblems and decision variables in the branch-and-bound procedure.

AB - Scheduling plays a key role in batch process operation; it has a major effect on the process' performance. Available methods for determining the optimal schedule are primarily based on either MILP/MINLP formulation in conjunction with mathematical programming (Floudas and Lin, 2004; Vaklieva-Bancheva and Kirilova, 2010) or graph representation in conjunction with combinatorial algorithms (Sanmarti et al., 2002).The current work comprises three major contributions. First, an algorithm has been crafted to generate a superstructure for a scheduling problem. The problem is defined in the form of an S-graph representing the recipe. The superstructure contains exclusively every step potentially performed by any of the functional or operating facilities or equipment units capable of completing at least one task to be scheduled. These steps involve executions of tasks and changeovers from one task to another. Second, an MILP formulation is elaborated on the basis of the superstructure, which guarantees the optimal solution of the scheduling problem. Third, a relaxation of the MILP model is incorporated into the S-graph algorithms to support the selection of subproblems and decision variables in the branch-and-bound procedure.

KW - MILP

KW - S-graph

KW - Scheduling

KW - Superstructure

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

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

U2 - 10.1016/B978-0-444-53711-9.50221-2

DO - 10.1016/B978-0-444-53711-9.50221-2

M3 - Book

AN - SCOPUS:79958787789

VL - 29

T3 - Computer Aided Chemical Engineering

BT - Superstructure Approach to Batch Process Scheduling by S-graph Representation

PB - Unknown Publisher

ER -