- Tytuł:
- Two meta-heuristic algorithms for scheduling on unrelated machines with the late work criterion
- Autorzy:
-
Wang, Wen
Chen, Xin
Musial, Jędrzej
Blazewicz, Jacek - Tematy:
-
late work minimization
unrelated machines
tabu search
genetic algorithm
minimalizacja opóźnienia
przeszukiwanie tabu
algorytm genetyczny - Pokaż więcej
- Wydawca:
- Uniwersytet Zielonogórski. Oficyna Wydawnicza
- Powiązania:
- https://bibliotekanauki.pl/articles/330022.pdf Link otwiera się w nowym oknie
- Opis:
- A scheduling problem in considered on unrelated machines with the goal of total late work minimization, in which the late work of a job means the late units executed after its due date. Due to the NP-hardness of the problem, we propose two meta-heuristic algorithms to solve it, namely, a tabu search (TS) and a genetic algorithm (GA), both of which are equipped with the techniques of initialization, iteration, as well as termination. The performances of the designed algorithms are verified through computational experiments, where we show that the GA can produce better solutions but with a higher time consumption. Moreover, we also analyze the influence of problem parameters on the performances of these metaheuristics.
- Dostawca treści:
- Biblioteka Nauki
Artykuł