A New Algorithm for Determination of the Optimum Storage Distribution of Multiproduct Batch Processes

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F60461373%3A22340%2F99%3A0003327" target="_blank" >RIV/60461373:22340/99:0003327 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

A New Algorithm for Determination of the Optimum Storage Distribution of Multiproduct Batch Processes

Popis výsledku v původním jazyce

Search for the optimum finite storage distribution belongs to the important problems of multi?product batch process scheduling. The usual method of solving the problem consists in a rotation of two optimization methods: search for the optimum sch of theprocess for the specific storage distribution and search for a better storage distribution until the optimum storage distribution is reached. A new algorithm determines the optimum schedule for the unlimited storage configuration first it computes the occupation time periods for all the apparatuses and storage units. After time analysis of them the algorithm designs a new distribution of storage units that very probably is the optimum one. For distribution are needed usually two, maximally three calculations of the optimum schedule.

Název v anglickém jazyce

A New Algorithm for Determination of the Optimum Storage Distribution of Multiproduct Batch Processes

Popis výsledku anglicky

Search for the optimum finite storage distribution belongs to the important problems of multi?product batch process scheduling. The usual method of solving the problem consists in a rotation of two optimization methods: search for the optimum sch of theprocess for the specific storage distribution and search for a better storage distribution until the optimum storage distribution is reached. A new algorithm determines the optimum schedule for the unlimited storage configuration first it computes the occupation time periods for all the apparatuses and storage units. After time analysis of them the algorithm designs a new distribution of storage units that very probably is the optimum one. For distribution are needed usually two, maximally three calculations of the optimum schedule.

Druh

A - Audiovizuální tvorba

CEP obor

CI - Průmyslová chemie a chemické inženýrství

OECD FORD obor

—

Projekt

—

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

1999

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

ISBN

80-227-1228-0

Místo vydání

Bratislava, Slovakia

Název nakladatele resp. objednatele

12th Conference Process Control '99

Verze

—

Identifikační číslo nosiče

—