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

Article name in the collection
Proc. of 29th International Conference of Slovak Society of Chemical Engineering
ISBN
80-227-1690-1
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
"I1-1"-"I1-6"
Publisher name
Slovak University of Technology
Place of publication
Bratislava
Event location
Tatranské Matliare
Event date
May 27, 2002
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—

Similar results(10)