Open AccessAnalysis of usage of genetic and tabu search algorithms in shop scheduling
Author(s) -
Edgaras Šakurovas,
Narimantas Listopadskis
Publication year - 2008
Publication title -
lietuvos matematikos rinkinys
Language(s) - English
Resource type - Journals
eISSN - 2335-898X
pISSN - 0132-2818
DOI - 10.15388/lmr.2008.18101
Subject(s) - tabu search , flow shop scheduling , job shop scheduling , metaheuristic , computer science , scheduling (production processes) , guided local search , mathematical optimization , genetic algorithm , job shop , algorithm , mathematics , machine learning , schedule , operating system
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 oftheir 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 variouscriteria.