- 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ł