Similar Search Results

Approximating a two-machine flow shop scheduling under discrete scenario uncertainty

Kasperski, Adam; Kurpisz, Adam; Zieliński, Paweł - In: European Journal of Operational Research 217 (2012) 1, pp. 36-43

This paper deals with the two machine permutation flow shop problem with uncertain data, whose deterministic counterpart is known to be polynomially solvable. In this paper, it is assumed that job processing times are uncertain and they are specified as a discrete scenario set. For this...

Persistent link: https://www.econbiz.de/10011052395

A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion

Kasperski, Adam; Zieliński, Paweł - In: Operations research letters 36 (2008) 3, pp. 343-344

Persistent link: https://www.econbiz.de/10003773804

Robust min-max (regret) optimization using ordered weighted averaging

Baak, Werner; Goerigk, Marc; Kasperski, Adam; … - In: European journal of operational research : EJOR 322 (2025) 1, pp. 171-181

Persistent link: https://www.econbiz.de/10015410184

A framework of distributionally robust possibilistic optimization

Guillaume, Romain; Kasperski, Adam; Zieliński, Paweł - In: Fuzzy optimization and decision making : a journal of … 23 (2024) 2, pp. 253-278

Persistent link: https://www.econbiz.de/10015079784

On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data

Kasperski, Adam; Zieliński, Paweł - In: Operations research letters 35 (2007) 4, pp. 525-532

Persistent link: https://www.econbiz.de/10007769962

Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion

Kasperski, Adam; Zieliński, Paweł - In: Operations research letters 41 (2013) 6, pp. 639-643

Persistent link: https://www.econbiz.de/10010236070

Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights

Kasperski, Adam; Zieliński, Paweł - In: European journal of operational research : EJOR 200 (2009/10) 3, pp. 680-687

Persistent link: https://www.econbiz.de/10003892325

Approximating a two-machine flow shop scheduling under discrete scenario uncertainty

Kasperski, Adam; Kurpisz, Adam; Zieliński, Paweł - In: European journal of operational research : EJOR 217 (2012) 1, pp. 36-43

Persistent link: https://www.econbiz.de/10009388680

A randomized algorithm for the min-max selecting items problem with uncertain weights

Kasperski, Adam; Zieliński, Paweł - 2009

Persistent link: https://www.econbiz.de/10003934292

Approximability of the robust representatives selection problem

Kasperski, Adam; Kurpisz, Adam; Zieliński, Paweł - In: Operations research letters 43 (2015) 1, pp. 16-19

Persistent link: https://www.econbiz.de/10010486378