Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: min-max regret

Sortuj według:

Ogranicz wyniki do:

Evolutionary algorithm for minmax regret flow-shop problem

Ćwik M., Józefczyk J.

Management and Production Engineering Review

2015

Vol. 6, No. 3

3--9

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.

Scatter Search based algorithms for min-max regret task scheduling problems with interval uncertainty

Józefczyk J., Siepak M.

Control and Cybernetics

2013

Vol. 42, no. 3

667--698

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.