Analysis of usage of genetic and tabu search algorithms in shop scheduling
Articles
Edgaras Šakurovas
Kauno technologijos universitetas
Narimantas Listopadskis
Kauno technologijos universitetas
Published 2008-12-21
https://doi.org/10.15388/LMR.2008.18101
PDF

Keywords

genetic algorithm
tabu search
algorithm strategy
algorithm modification

How to Cite

Šakurovas E. and Listopadskis N. (2008) “Analysis of usage of genetic and tabu search algorithms in shop scheduling”, Lietuvos matematikos rinkinys, 48(proc. LMS), pp. 233–238. doi: 10.15388/LMR.2008.18101.

Abstract

A wide area of scheduling problem is industrial so-called shop scheduling (Job Shop, Flow Shop and Open Shop) which has important applications in real world industrial problems. Metaheuristic algorithms
(Genetic and Tabu search algorithms in this case) seem to be one of the best candidates for finding nearbyoptima in proper time. In this work we implemented several genetic algorithms (separated by values of
their parameters) and several Tabu search algorithms (separated by neighborhood of solution). Finally, implemented eight algorithms are examined for random shop scheduling problems in terms of various
criteria.

PDF
Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Please read the Copyright Notice in Journal Policy