5 papers
Robust Permutation Flowshops Under Budgeted Uncertainty
Noam Goldberg, Danny Hermelin, Dvir Shabtay
We consider the robust permutation flowshop problem under the budgeted uncertainty model, where at most a given number of job processing times may deviate on each machine. We show…
A Parametrized Complexity View on Robust Scheduling with Budgeted Uncertainty
Noam Goldberg, Dvir Shabtay
In this study, we investigate a robust single-machine scheduling problem under processing time uncertainty. The uncertainty is modeled using the budgeted approach, where each job h…
Robust Extensible Bin Packing and Revisiting the Convex Knapsack Problem
Noam Goldberg, Michael Poss, Yariv Marmor
We study a robust extensible bin packing problem with budgeted uncertainty, under a budgeted uncertainty model where item sizes are defined to lie in the intersection of a box with…
Smooth Uncertainty Sets: Dependence of Uncertain Parameters via a Simple Polyhedral Set
Noam Goldberg, Michael Poss, Shimrit Shtern
We propose a novel polyhedral uncertainty set for robust optimization, termed the smooth uncertainty set, which captures dependencies of uncertain parameters by constraining their…
Projecting onto a Capped Rotated Second-Order Cone
Noam Goldberg, Ishy Zagdoun
We derive a closed-form expression for the projection onto a capped rotated second-order cone -- a convex set that arises in perspective relaxations of nonlinear programs with bina…