Szczegóły

Tytuł artykułu

Evolutionary Algorithm for Minmax Regret Flow-Shop Problem

Tytuł czasopisma

Management and Production Engineering Review

Rocznik

2015

Numer

No 3

Autorzy publikacji

Wydział PAN

Nauki Techniczne

Wydawca

Production Engineering Committee of the Polish Academy of Sciences, Polish Association for Production Management

Data

2015[2015.01.01 AD - 2015.12.31 AD]

Identyfikator

ISSN 2080-8208 ; eISSN 2082-1344

Referencje

Nawaz (1983), A heuristic algorithm for the m - machine n - job flow - shop sequencing problem, The International Journal of Management Science, 11. ; Aissi (2009), Min - max and min - max regret versions of combinatorial optimization problems survey, European Journal of Operational Research, 197. ; Kasperski (2008), - approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion, Operations Research Letters, 42. ; Averbakh (2000), Minimax regret solutions for minimax optimization problems with uncertainty, European Journal of Operational Research, 27, 57. ; Lebedev (2006), Complexity of minimizing the total flow time with interval data and minmax regret criterion, Discrete Applied Mathematics, 154. ; Dutt (2013), Handling of Uncertainty - A Survey of Scientific and Research Publications, International Journal, 3. ; Conde (2010), - approximation for minmax regret problems via a mid - point scenario optimal solution, Operations Research Letters, 38, 326, doi.org/10.1016/j.orl.2010.03.002 ; Averbakh (2006), The minmax regret permutation flowshop problem with two jobs, Operations Research Letters, 69. ; Siepak (2014), Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion, Annals of Operations Research, 222. ; Garey (1976), The complexity of flowshop and jobshop scheduling, Mathematics of Operations Research, 1.

DOI

10.1515/mper-2015-0021

×