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

J. Heinonen; F. Pettersson

doi:10.1016/S1570-7946(02)80141-9

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

J. Heinonen^*
, F. Pettersson

^*Korresponderande författare för detta arbete

Process- och systemteknik

Forskningsoutput: Kapitel i bok/konferenshandling › Kapitel › Vetenskaplig › Peer 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åk	Engelska
Titel på värdpublikation	Computer Aided Chemical Engineering
Förlag	Elsevier
Sidor	679-684
Antal sidor	6
Volym	10
Utgåva	C
DOI	https://doi.org/10.1016/S1570-7946(02)80141-9
Status	Publicerad - 2002
MoE-publikationstyp	A3 Del av bok eller annan forskningsbok

Publikationsserier

Namn	Computer Aided Chemical Engineering
Nummer	C
Volym	10
ISSN (tryckt)	1570-7946

Finansiering

- The financial support from TEKES, the Finnish Technology Agency, is gratefully acknowledged.

Åtkomst av dokument

10.1016/S1570-7946(02)80141-9Licens: Publisher rights policy

Andra filer och länkar

Link to publication in Scopus

Citera det här

@inbook{35fc895ef87a43c19211a34605dcdbc4,

title = "Comparison of three scheduling methods for a batch process with a recycle",

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.",

author = "J. Heinonen and F. Pettersson",

year = "2002",

doi = "10.1016/S1570-7946(02)80141-9",

language = "English",

volume = "10",

series = "Computer Aided Chemical Engineering",

publisher = "Elsevier",

number = "C",

pages = "679--684",

booktitle = "Computer Aided Chemical Engineering",

edition = "C",

}

TY - CHAP

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

AU - Heinonen, J.

AU - Pettersson, F.

PY - 2002

Y1 - 2002

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/77956743742

U2 - 10.1016/S1570-7946(02)80141-9

DO - 10.1016/S1570-7946(02)80141-9

M3 - Chapter

AN - SCOPUS:77956743742

VL - 10

T3 - Computer Aided Chemical Engineering

SP - 679

EP - 684

BT - Computer Aided Chemical Engineering

PB - Elsevier

ER -

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

Sammanfattning

Publikationsserier

Finansiering

Åtkomst av dokument

Andra filer och länkar

Fingeravtryck

Citera det här