The Application of Tabu Search Method to the Waste Minimization through Flowshop Sequencing

Kód výsledku v IS VaVaI

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

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

The Application of Tabu Search Method to the Waste Minimization through Flowshop Sequencing

Popis výsledku v původním jazyce

In the multiproduct plant the process tasks for each product can be assigned to a fixed sequence of equipment items. Then, the products are produced in sequential campaigns. Because of the NP-hard nature of the scheduling problem, tabu search heu tabu search heuristic belongs to the approaches that allow to speed-up the computational process considerable. We have tested various modifications of tabu search method and found the best values of parameters and the best modification the or search algorithm.Usually the total processing time (makespan) is as objective function minimized. But during product changeover various effluents, waste and nonstandard products arise and increase cost of their cost of its treatment are usually processing sequence dependent. That?s why our emphasis is now posed on searching of such a schedule that minimize waste treatment costs or product changeover costs generally

Název v anglickém jazyce

The Application of Tabu Search Method to the Waste Minimization through Flowshop Sequencing

Popis výsledku anglicky

In the multiproduct plant the process tasks for each product can be assigned to a fixed sequence of equipment items. Then, the products are produced in sequential campaigns. Because of the NP-hard nature of the scheduling problem, tabu search heu tabu search heuristic belongs to the approaches that allow to speed-up the computational process considerable. We have tested various modifications of tabu search method and found the best values of parameters and the best modification the or search algorithm.Usually the total processing time (makespan) is as objective function minimized. But during product changeover various effluents, waste and nonstandard products arise and increase cost of their cost of its treatment are usually processing sequence dependent. That?s why our emphasis is now posed on searching of such a schedule that minimize waste treatment costs or product changeover costs generally

Druh

D - Stať ve sborníku

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ů

Název statě ve sborníku

Proceedings of the Conference Modelling and Simulation of Systems MOSIS '99

ISBN

80-85988-32-1

ISSN

—

e-ISSN

—

Počet stran výsledku

8

Strana od-do

—

Název nakladatele

Department of Computer Science of FEEI VŠB - TU Ostrava, Department of Computer Science of FEECS VUT Brno, ASU, CSSS, EUROSIM, SCS

Místo vydání

Ostrava, Czech Repub

Místo konání akce

—

Datum konání akce

—

Typ akce podle státní příslušnosti

—

Kód UT WoS článku

—