Finding Non-permutation Schedules for Flowshops Using Tabu Search Algorithm

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

Result language
angličtina
Original language name
Finding Non-permutation Schedules for Flowshops Using Tabu Search Algorithm
Original language description
General opinion is that near-optimal solutions of the chemical flowshop sequencing problem can be arrived at under assumption of permutation schedule. The permutation schedule limits the search space, assuming that the sequence of products is identical on all processing units, and therefore the optimization is less difficult. In this paper, results of application of a tabu search algorithm to the sequencing problem where non-permutation schedules are used are presented. The problem is formulated as a minimization of makespan with unlimited intermediate storage interstage policy, with time-requirements model of operations. A comparison is made between permutation schedule and non-permutation schedule solutions. The results of tests of different variantsof tabu search algorithm are discussed, and comparison is made between tabu search and other optimization techniques.
Czech name
—
Czech description
—

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

Similar results(10)