Simulated Annealing and Tabu Search for solving the Single Machine Scheduling problem

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F44555601%3A13440%2F23%3A43896609" target="_blank" >RIV/44555601:13440/23:43896609 - isvavai.cz</a>

Výsledek na webu

<a href="http://10.1007/978-3-031-19945-5_8" target="_blank" >http://10.1007/978-3-031-19945-5_8</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-031-19945-5_8" target="_blank" >10.1007/978-3-031-19945-5_8</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Simulated Annealing and Tabu Search for solving the Single Machine Scheduling problem

Popis výsledku v původním jazyce

This paper presents a comparative study of two metaheuristic optimization algorithms for solving the Total Weighted Tardiness problem in its single-machine mode, which represents the most frequent scheduling and sorting problems occurring in the industrial environment. The metaheuristics evaluated in this study were Tabu Search, and Simulated Annealing, because they have shown to obtain good results in this kind of problems. The performance of each algorithm was evaluated by means of the total tardiness and the execution time using instances of 40, 50, and 100 jobs extracted from the OR-Library. The Simulated Annealing algorithm was found to be the most efficient method, being the one that found the best solutions in comparison to Tabu Search, nonetheless, Tabu Search found the results in the shortest time. A difference approximated of 24 units between Simulated Annealing and Tabu search was found in the total tardiness value when a set of 125 instances were executed. On the other hand, Tabu Search required only the 13% of the time execution required by Simulated Annealing.

Název v anglickém jazyce

Simulated Annealing and Tabu Search for solving the Single Machine Scheduling problem

Popis výsledku anglicky

This paper presents a comparative study of two metaheuristic optimization algorithms for solving the Total Weighted Tardiness problem in its single-machine mode, which represents the most frequent scheduling and sorting problems occurring in the industrial environment. The metaheuristics evaluated in this study were Tabu Search, and Simulated Annealing, because they have shown to obtain good results in this kind of problems. The performance of each algorithm was evaluated by means of the total tardiness and the execution time using instances of 40, 50, and 100 jobs extracted from the OR-Library. The Simulated Annealing algorithm was found to be the most efficient method, being the one that found the best solutions in comparison to Tabu Search, nonetheless, Tabu Search found the results in the shortest time. A difference approximated of 24 units between Simulated Annealing and Tabu search was found in the total tardiness value when a set of 125 instances were executed. On the other hand, Tabu Search required only the 13% of the time execution required by Simulated Annealing.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

—

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2023

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

Lecture Notes in Networks and Systems

ISBN

—

ISSN

2367-3370

e-ISSN

2367-3389

Počet stran výsledku

10

Strana od-do

86-95

Název nakladatele

Springer Nature

Místo vydání

Basel

Místo konání akce

Tirana, Albania

Datum konání akce

27. 10. 2022

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

WRD - Celosvětová akce

Kód UT WoS článku

—