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%3A00007162" target="_blank" >RIV/60461373:22340/02:00007162 - 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

In this paper we present our results with a use of tabu search -based algorithm to the sequencing problem where non-permutation schedules are used. The problem is formulated as a minimization of makespan with unlimited intermediate storage interstage policy, with time-requirements model of operations. The results of tests of different variants of tabu search algorithm are discussed, and comparison is made between tabu search and other optimization techniques. We have proved that tabu search algorithm can be applied to solving of flowshop scheduling problem with non-permutation schedules, even in its simpler variant limited to recency-based memory structures. The algorithm is able to find NPS solution better than PS solution in acceptable computation time. As the relatively simple algorithm we use can be, within the limits of tabu search ideas, expanded upon, we expect that with further research it can be improved, increasing both search success rate and solution quality.

Název v anglickém jazyce

Finding Non-permutation Schedules for Flowshops Using Tabu Search Algorithm

Popis výsledku anglicky

In this paper we present our results with a use of tabu search -based algorithm to the sequencing problem where non-permutation schedules are used. The problem is formulated as a minimization of makespan with unlimited intermediate storage interstage policy, with time-requirements model of operations. The results of tests of different variants of tabu search algorithm are discussed, and comparison is made between tabu search and other optimization techniques. We have proved that tabu search algorithm can be applied to solving of flowshop scheduling problem with non-permutation schedules, even in its simpler variant limited to recency-based memory structures. The algorithm is able to find NPS solution better than PS solution in acceptable computation time. As the relatively simple algorithm we use can be, within the limits of tabu search ideas, expanded upon, we expect that with further research it can be improved, increasing both search success rate and solution quality.

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 29th International Conference of Slovak Society of Chemical Engineering

ISBN

80-227-1690-1

ISSN

—

e-ISSN

—

Počet stran výsledku

6

Strana od-do

"I1-1"-"I1-6"

Název nakladatele

Slovak University of Technology

Místo vydání

Bratislava

Místo konání akce

Tatranské Matliare

Datum konání akce

27. 5. 2002

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

EUR - Evropská akce

Kód UT WoS článku

—