Cyclic short-term scheduling of multiproduct batch plants using continuous-time representation

D. Wu, Marianthi Ierapetritou

Research output: Contribution to journalArticle

49 Citations (Scopus)

Abstract

The idea of cyclic scheduling is commonly utilized to address short-term scheduling problems for multiproduct batch plants under the assumption of relatively stable operations and product demands. It requires the determination of optimal cyclic schedule, thus greatly reducing the size of the overall scheduling problems with large time horizon. In this paper a new cyclic scheduling approach is proposed based on the state-task network (STN) representation of the plant [Comput. Chem. Eng. 17 (1993) 211] and a continuous-time formulation [Ind. Eng. Chem. Res. 37 (1998a) 4341]. Assuming that product demands and prices are not fluctuating along the time horizon under consideration, the proposed formulation determines the optimal cycle length as well as the timing and sequencing of tasks within a cycle. This formulation corresponds to a non-convex mixed integer nonlinear programming (MINLP) problem, for which local and global optimization algorithms are used and the results are illustrated for various case studies.

Original languageEnglish (US)
Pages (from-to)2271-2286
Number of pages16
JournalComputers and Chemical Engineering
Volume28
Issue number11
DOIs
StatePublished - Oct 15 2004

Fingerprint

Scheduling
Nonlinear programming
Global optimization

All Science Journal Classification (ASJC) codes

  • Chemical Engineering(all)
  • Computer Science Applications

Keywords

  • Continuous-time formulation
  • Cyclic scheduling
  • MINLP

Cite this

@article{20a75b2d018044fbb0290cdcb076ab85,
title = "Cyclic short-term scheduling of multiproduct batch plants using continuous-time representation",
abstract = "The idea of cyclic scheduling is commonly utilized to address short-term scheduling problems for multiproduct batch plants under the assumption of relatively stable operations and product demands. It requires the determination of optimal cyclic schedule, thus greatly reducing the size of the overall scheduling problems with large time horizon. In this paper a new cyclic scheduling approach is proposed based on the state-task network (STN) representation of the plant [Comput. Chem. Eng. 17 (1993) 211] and a continuous-time formulation [Ind. Eng. Chem. Res. 37 (1998a) 4341]. Assuming that product demands and prices are not fluctuating along the time horizon under consideration, the proposed formulation determines the optimal cycle length as well as the timing and sequencing of tasks within a cycle. This formulation corresponds to a non-convex mixed integer nonlinear programming (MINLP) problem, for which local and global optimization algorithms are used and the results are illustrated for various case studies.",
keywords = "Continuous-time formulation, Cyclic scheduling, MINLP",
author = "D. Wu and Marianthi Ierapetritou",
year = "2004",
month = "10",
day = "15",
doi = "10.1016/j.compchemeng.2004.04.002",
language = "English (US)",
volume = "28",
pages = "2271--2286",
journal = "Computers and Chemical Engineering",
issn = "0098-1354",
publisher = "Elsevier BV",
number = "11",

}

Cyclic short-term scheduling of multiproduct batch plants using continuous-time representation. / Wu, D.; Ierapetritou, Marianthi.

In: Computers and Chemical Engineering, Vol. 28, No. 11, 15.10.2004, p. 2271-2286.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Cyclic short-term scheduling of multiproduct batch plants using continuous-time representation

AU - Wu, D.

AU - Ierapetritou, Marianthi

PY - 2004/10/15

Y1 - 2004/10/15

N2 - The idea of cyclic scheduling is commonly utilized to address short-term scheduling problems for multiproduct batch plants under the assumption of relatively stable operations and product demands. It requires the determination of optimal cyclic schedule, thus greatly reducing the size of the overall scheduling problems with large time horizon. In this paper a new cyclic scheduling approach is proposed based on the state-task network (STN) representation of the plant [Comput. Chem. Eng. 17 (1993) 211] and a continuous-time formulation [Ind. Eng. Chem. Res. 37 (1998a) 4341]. Assuming that product demands and prices are not fluctuating along the time horizon under consideration, the proposed formulation determines the optimal cycle length as well as the timing and sequencing of tasks within a cycle. This formulation corresponds to a non-convex mixed integer nonlinear programming (MINLP) problem, for which local and global optimization algorithms are used and the results are illustrated for various case studies.

AB - The idea of cyclic scheduling is commonly utilized to address short-term scheduling problems for multiproduct batch plants under the assumption of relatively stable operations and product demands. It requires the determination of optimal cyclic schedule, thus greatly reducing the size of the overall scheduling problems with large time horizon. In this paper a new cyclic scheduling approach is proposed based on the state-task network (STN) representation of the plant [Comput. Chem. Eng. 17 (1993) 211] and a continuous-time formulation [Ind. Eng. Chem. Res. 37 (1998a) 4341]. Assuming that product demands and prices are not fluctuating along the time horizon under consideration, the proposed formulation determines the optimal cycle length as well as the timing and sequencing of tasks within a cycle. This formulation corresponds to a non-convex mixed integer nonlinear programming (MINLP) problem, for which local and global optimization algorithms are used and the results are illustrated for various case studies.

KW - Continuous-time formulation

KW - Cyclic scheduling

KW - MINLP

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

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

U2 - 10.1016/j.compchemeng.2004.04.002

DO - 10.1016/j.compchemeng.2004.04.002

M3 - Article

AN - SCOPUS:4143112202

VL - 28

SP - 2271

EP - 2286

JO - Computers and Chemical Engineering

JF - Computers and Chemical Engineering

SN - 0098-1354

IS - 11

ER -