- Tytuł:
- Stable scheduling of single machine with probabilistic parameters
- Autorzy:
-
Bożejko, W.
Rajba, P.
Wodecki, M. - Powiązania:
- https://bibliotekanauki.pl/articles/200225.pdf
- Data publikacji:
- 2017
- Wydawca:
- Polska Akademia Nauk. Czytelnia Czasopism PAN
- Tematy:
-
scheduling
uncertain parameters
tabu search
stability
planowanie
niepewne parametry
stabilność
przeszukiwanie tabu - Opis:
- We consider a stochastic variant of the single machine total weighted tardiness problem jobs parameters are independent random variables with normal or Erlang distributions. Since even deterministic problem is NP-hard, it is difficult to find global optimum for large instances in the reasonable run time. Therefore, we propose tabu search metaheuristics in this work. Computational experiments show that solutions obtained by the stochastic version of metaheuristics are more stable (i.e. resistant to data disturbance) than solutions generated by classic, deterministic version of the algorithm.
- Źródło:
-
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2017, 65, 2; 219-231
0239-7528 - Pojawia się w:
- Bulletin of the Polish Academy of Sciences. Technical Sciences
- Dostawca treści:
- Biblioteka Nauki
Artykuł