- Tytuł:
- Scatter Search based algorithms for min-max regret task scheduling problems with interval uncertainty
- Autorzy:
-
Józefczyk, J.
Siepak, M. - Powiązania:
- https://bibliotekanauki.pl/articles/206069.pdf
- Data publikacji:
- 2013
- Wydawca:
- Polska Akademia Nauk. Instytut Badań Systemowych PAN
- Tematy:
-
task scheduling
interval uncertainty
min-max regret
branch and bound - Opis:
- Uncertain versions of three task scheduling problems: P║Cmax, F2║Cmax, R║Σ Cj are investigated. Parametric uncertainty is only considered which is represented by intervals. It is assumed that values of execution times of tasks are not a priori given, and they belong to the intervals of known bounds. No distributions additionally characterizing the uncertain parameters are assumed. The regret is used as the basis for a criterion evaluating the uncertainty. In a consequence, min-max regret combinatorial problems are solved. Heuristic algorithms based on Scatter Search are proposed. They are evaluated via computational experiments and compared to a simple middle intervals heuristics and to exact solutions for small instances of the problems considered.
- Źródło:
-
Control and Cybernetics; 2013, 42, 3; 667-698
0324-8569 - Pojawia się w:
- Control and Cybernetics
- Dostawca treści:
- Biblioteka Nauki
Artykuł