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

J. Heinonen*, F. Pettersson

*Corresponding author for this work

Research output: Chapter in Book/Conference proceedingChapterScientificpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationComputer Aided Chemical Engineering
PublisherElsevier
Pages679-684
Number of pages6
EditionC
DOIs
Publication statusPublished - 2002
MoE publication typeA3 Part of a book or another research book

Publication series

NameComputer Aided Chemical Engineering
NumberC
Volume10
ISSN (Print)1570-7946

Fingerprint Dive into the research topics of 'Comparison of three scheduling methods for a batch process with a recycle'. Together they form a unique fingerprint.

Cite this