Autor: Józefczyk, M. - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Evolutionary algorithm for minmax regret flow-shop problem
Autorzy:: Ćwik, M.
Józefczyk, J.
Powiązania:: https://bibliotekanauki.pl/articles/406859.pdf
Data publikacji:: 2015
Wydawca:: Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:: manufacturing
flow-shop
interval uncertainty
min-max regret
heuristic algorithms
evolutionary algorithms
simulation
Opis:: The uncertain flow-shop is considered. It is assumed that processing times are not given a priori, but they belong to intervals of known bounds. The absolute regret (regret) is used to evaluate a solution (a schedule) which gives the minmax regret binary optimization problem. The evolutionary heuristic solution algorithm is experimentally compared with a simple middle interval heuristic algorithm for three machines instances. The conducted simulations confirmed the several percent advantage of the evolutionary approach.
Źródło:: Management and Production Engineering Review; 2015, 6, 3; 3-9
2080-8208
2082-1344
Pojawia się w:: Management and Production Engineering Review
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

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║C_max, F2║C_max, R║Σ C_j 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ł

Informacja