Finding Non-permutation Schedules for Flowshops Using Tabu Search Algorithm

Kód výsledku v 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>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Finding Non-permutation Schedules for Flowshops Using Tabu Search Algorithm

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Finding Non-permutation Schedules for Flowshops Using Tabu Search Algorithm

Popis výsledku anglicky

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.

Druh

D - Stať ve sborníku

CEP obor

JD - Využití počítačů, robotika a její aplikace

OECD FORD obor

—

Projekt

—

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2002

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

Proc. of 36th International Conference MOSIS '02

ISBN

80-85988-71-2

ISSN

—

e-ISSN

—

Počet stran výsledku

7

Strana od-do

103-109

Název nakladatele

Fac.Of Inf. Tech. VUT Brno

Místo vydání

Brno

Místo konání akce

Rožnov pod Radhoštěm

Datum konání akce

22. 4. 2002

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

EUR - Evropská akce

Kód UT WoS článku

—