Optimization of Topology and Schedule of Batch Flowshops with Parallel Procesors

Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F60461373%3A22340%2F01%3A00003887" target="_blank" >RIV/60461373:22340/01:00003887 - isvavai.cz</a>
Výsledek na webu
—
DOI - Digital Object Identifier
—

Jazyk výsledku
angličtina
Název v původním jazyce
Optimization of Topology and Schedule of Batch Flowshops with Parallel Procesors
Popis výsledku v původním jazyce
The problem of optimization of batch process production plan is most often solved for flowshop topology, i.e. for simple series of apparatuses. This paper deals with the possibilities of application of tabu search heuristics to an expanded variant of such a topology, specifically to flowshops with added limited number of doubled apparatuses. In addition to the problem of optimization of such a topology, the problem of simultaneous optimization of both production plan and plant topology is described here.
Název v anglickém jazyce
Optimization of Topology and Schedule of Batch Flowshops with Parallel Procesors
Popis výsledku anglicky
The problem of optimization of batch process production plan is most often solved for flowshop topology, i.e. for simple series of apparatuses. This paper deals with the possibilities of application of tabu search heuristics to an expanded variant of such a topology, specifically to flowshops with added limited number of doubled apparatuses. In addition to the problem of optimization of such a topology, the problem of simultaneous optimization of both production plan and plant topology is described here.

Rok uplatnění
2001
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ů

Podobné výsledky(10)