Comparison of three scheduling methods for a batch process with a recycle

J. Heinonen*, F. Pettersson

*Korresponderande författare för detta arbete

Forskningsoutput: Kapitel i bok/konferenshandlingKapitelVetenskapligPeer review

Sammanfattning

A short term scheduling problem from an industrial case is modelled in three different ways. A discretized MILP-model, a heuristic approach and a genetic algorithm are tested. The scheduling task is complicated by a recycle connection. Storage capacity for raw materials and intermediates are restricted. Some productions steps are operated continuously and some in batch mode. A one-week schedule and a two-week schedule are constructed with different models and compared with industrial results. The genetic algorithm outperforms the other approaches, though the computational efforts are larger.

OriginalspråkEngelska
Titel på gästpublikationComputer Aided Chemical Engineering
FörlagElsevier
Sidor679-684
Antal sidor6
UtgåvaC
DOI
StatusPublicerad - 2002
MoE-publikationstypA3 Del av bok eller annan forskningsbok

Publikationsserier

NamnComputer Aided Chemical Engineering
NummerC
Volym10
ISSN (tryckt)1570-7946

Fingeravtryck Fördjupa i forskningsämnen för ”Comparison of three scheduling methods for a batch process with a recycle”. Tillsammans bildar de ett unikt fingeravtryck.

Citera det här