Scheduling a specific type of batch process with evolutionary computation

Jukka Heinonen; Frank Pettersson

doi:10.1109/CEC.2003.1299771

Scheduling a specific type of batch process with evolutionary computation

Jukka Heinonen
, Frank Pettersson

Process- och systemteknik

Forskningsoutput: Kapitel i bok/konferenshandling › Publicerad konferensartikel › Vetenskaplig › Peer review

6 Citeringar (Scopus)

Sammanfattning

A genetic algorithm is used to calculate production schedules for a specific type of batch-mode manufacturing process. Previous scheduling efforts included both time discretised MILP as well as continuous-time MILP, both of which were outperformed by the GA when measured in calculation times and final schedule accuracy. The approach is two-folded and an algorithm to reproduce it on similar processes is presented.

Originalspråk	Engelska
Titel på värdpublikation	The 2003 Congress on Evolutionary Computation, 2003. CEC '03
Förlag	IEEE
Sidor	966-970
Antal sidor	5
ISBN (tryckt)	0-7803-7804-0
DOI	https://doi.org/10.1109/CEC.2003.1299771
Status	Publicerad - 2003
MoE-publikationstyp	A4 Artikel i en konferenspublikation
Evenemang	2003 Congress on Evolutionary Computation, CEC 2003 - Canberra, ACT, Australien Varaktighet: 8 dec. 2003 → 12 dec. 2003

Konferens

Konferens	2003 Congress on Evolutionary Computation, CEC 2003
Land/Territorium	Australien
Ort	Canberra, ACT
Period	08/12/03 → 12/12/03

Åtkomst av dokument

10.1109/CEC.2003.1299771

Andra filer och länkar

Link to publication in Scopus

Citera det här

@inproceedings{8a4b70771b01472c9f746fdd5c414dce,

title = "Scheduling a specific type of batch process with evolutionary computation",

abstract = "A genetic algorithm is used to calculate production schedules for a specific type of batch-mode manufacturing process. Previous scheduling efforts included both time discretised MILP as well as continuous-time MILP, both of which were outperformed by the GA when measured in calculation times and final schedule accuracy. The approach is two-folded and an algorithm to reproduce it on similar processes is presented.",

author = "Jukka Heinonen and Frank Pettersson",

year = "2003",

doi = "10.1109/CEC.2003.1299771",

language = "English",

isbn = "0-7803-7804-0",

pages = "966--970",

booktitle = "The 2003 Congress on Evolutionary Computation, 2003. CEC '03",

publisher = "IEEE",

address = "United States",

note = "2003 Congress on Evolutionary Computation, CEC 2003 ; Conference date: 08-12-2003 Through 12-12-2003",

}

TY - GEN

T1 - Scheduling a specific type of batch process with evolutionary computation

AU - Heinonen, Jukka

AU - Pettersson, Frank

PY - 2003

Y1 - 2003

N2 - A genetic algorithm is used to calculate production schedules for a specific type of batch-mode manufacturing process. Previous scheduling efforts included both time discretised MILP as well as continuous-time MILP, both of which were outperformed by the GA when measured in calculation times and final schedule accuracy. The approach is two-folded and an algorithm to reproduce it on similar processes is presented.

AB - A genetic algorithm is used to calculate production schedules for a specific type of batch-mode manufacturing process. Previous scheduling efforts included both time discretised MILP as well as continuous-time MILP, both of which were outperformed by the GA when measured in calculation times and final schedule accuracy. The approach is two-folded and an algorithm to reproduce it on similar processes is presented.

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

U2 - 10.1109/CEC.2003.1299771

DO - 10.1109/CEC.2003.1299771

M3 - Published conference proceeding

AN - SCOPUS:25144512095

SN - 0-7803-7804-0

SP - 966

EP - 970

BT - The 2003 Congress on Evolutionary Computation, 2003. CEC '03

PB - IEEE

T2 - 2003 Congress on Evolutionary Computation, CEC 2003

Y2 - 8 December 2003 through 12 December 2003

ER -

Scheduling a specific type of batch process with evolutionary computation

Sammanfattning

Konferens

Åtkomst av dokument

Andra filer och länkar

Fingeravtryck

Citera det här