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

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F60461373%3A22340%2F99%3A0003276" target="_blank" >RIV/60461373:22340/99:0003276 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
The Application of Tabu Search Method to the Waste Minimization through Flowshop Sequencing
Original language description
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
Czech name
—
Czech description
—

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

ISBN
80-85988-32-1
Place of publication
Ostrava, Czech Repub
Publisher/client name
33rd Spring International Conference Modelling and Simulation of Systems MOSIS '99
Version
—
Carrier ID
—

Similar results(10)