13 citations · 24 across the 24 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DS2017
Risk averse single machine scheduling - complexity and approximation
Adam Kasperski, Pawel Zielinski
In this paper a class of single machine scheduling problems is considered. It is assumed that job processing times and due dates can be uncertain and they are specified in the form…
math.OC2017
On Recoverable and Two-Stage Robust Selection Problems with Budgeted Uncertainty
André Chassein, Marc Goerigk, Adam Kasperski +1
In this paper the problem of selecting out of available items is discussed, such that their total cost is minimized. We assume that costs are not known exactly, but stem fr…