Scheduling of batch chemical processes under uncertainty: Multiproduct serial plants

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

The scheduling of batch chemical processes is studied in multiproduct serial plants. It is assumed that the processing time in each process unit is subject to random fluctuations that follow a normal distribution. The makespan, i.e., the time needed to obtain all products, is calculated using recurrence formulae for several types of batch processes that differ with respect to the sort of intermediate storage which is supposed to be available: UIS, NIS, FIS (respectively unlimited, nonexisting and finite intermediate storage), and ZW (zero wait plants). Since the processing times are uncertain, given a sequence of products, several samples are taken to find the most likely makespan and its uncertainty. The most favorable makespan is determined by the method of Simulated Annealing, which is adequate for optimization in combinatorial problems.

Original languageEnglish
Pages (from-to)142-151
Number of pages10
JournalBrazilian Journal of Chemical Engineering
Volume13
Issue number3
Publication statusPublished - Sep 1996
Externally publishedYes

Fingerprint

Scheduling
Normal distribution
Processing
Simulated annealing
Chemical reactions
Uncertainty

ASJC Scopus subject areas

  • Chemical Engineering(all)

Cite this

Scheduling of batch chemical processes under uncertainty : Multiproduct serial plants. / Castier, M.

In: Brazilian Journal of Chemical Engineering, Vol. 13, No. 3, 09.1996, p. 142-151.

Research output: Contribution to journalArticle

@article{ac4af89ee4bb454eabbfdcc4f08617ad,
title = "Scheduling of batch chemical processes under uncertainty: Multiproduct serial plants",
abstract = "The scheduling of batch chemical processes is studied in multiproduct serial plants. It is assumed that the processing time in each process unit is subject to random fluctuations that follow a normal distribution. The makespan, i.e., the time needed to obtain all products, is calculated using recurrence formulae for several types of batch processes that differ with respect to the sort of intermediate storage which is supposed to be available: UIS, NIS, FIS (respectively unlimited, nonexisting and finite intermediate storage), and ZW (zero wait plants). Since the processing times are uncertain, given a sequence of products, several samples are taken to find the most likely makespan and its uncertainty. The most favorable makespan is determined by the method of Simulated Annealing, which is adequate for optimization in combinatorial problems.",
author = "M. Castier",
year = "1996",
month = "9",
language = "English",
volume = "13",
pages = "142--151",
journal = "Brazilian Journal of Chemical Engineering",
issn = "0104-6632",
publisher = "Association Brasiliera de Eng. Quimica / Braz. Soc. Chem. Eng.",
number = "3",

}

TY - JOUR

T1 - Scheduling of batch chemical processes under uncertainty

T2 - Multiproduct serial plants

AU - Castier, M.

PY - 1996/9

Y1 - 1996/9

N2 - The scheduling of batch chemical processes is studied in multiproduct serial plants. It is assumed that the processing time in each process unit is subject to random fluctuations that follow a normal distribution. The makespan, i.e., the time needed to obtain all products, is calculated using recurrence formulae for several types of batch processes that differ with respect to the sort of intermediate storage which is supposed to be available: UIS, NIS, FIS (respectively unlimited, nonexisting and finite intermediate storage), and ZW (zero wait plants). Since the processing times are uncertain, given a sequence of products, several samples are taken to find the most likely makespan and its uncertainty. The most favorable makespan is determined by the method of Simulated Annealing, which is adequate for optimization in combinatorial problems.

AB - The scheduling of batch chemical processes is studied in multiproduct serial plants. It is assumed that the processing time in each process unit is subject to random fluctuations that follow a normal distribution. The makespan, i.e., the time needed to obtain all products, is calculated using recurrence formulae for several types of batch processes that differ with respect to the sort of intermediate storage which is supposed to be available: UIS, NIS, FIS (respectively unlimited, nonexisting and finite intermediate storage), and ZW (zero wait plants). Since the processing times are uncertain, given a sequence of products, several samples are taken to find the most likely makespan and its uncertainty. The most favorable makespan is determined by the method of Simulated Annealing, which is adequate for optimization in combinatorial problems.

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

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

M3 - Article

AN - SCOPUS:0030241554

VL - 13

SP - 142

EP - 151

JO - Brazilian Journal of Chemical Engineering

JF - Brazilian Journal of Chemical Engineering

SN - 0104-6632

IS - 3

ER -