3 papers
cs.DS2021
Optimally rescheduling jobs with a LIFO buffer
Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy +2
This paper considers single-machine scheduling problems in which a given solution, i.e. an ordered set of jobs, has to be improved as much as possible by re-sequencing the jobs. Th…
cs.DM2018
On a Stackelberg Subset Sum Game
Ulrich Pferschy, Gaia Nicosia, Andrea Pacifici
This contribution deals with a two-level discrete decision problem, a so-called Stackelberg strategic game: A Subset Sum setting is addressed with a set of items with given int…
cs.DM2008
Demand allocation with latency cost functions
Alessandro Agnetis, Enrico Grande, Andrea Pacifici
We address the exact resolution of a MINLP model where resources can be activated in order to satisfy a demand (a partitioning constraint) while minimizing total cost. Cost functio…