activity
20202026
collaborators

6 papers

math.PR2026

Measure-valued fluid limits for partial service queues with correlated patience and service times

Diego Goldsztajn, Fernando Paganini, Andres Ferragut

We consider a many-server queue where tasks with general patience and service times arrive as a renewal process. Contrary to the standard assumptions, we allow for preemption and a…

math.PR2025

Geometric lower bounds for the steady-state occupancy of processing networks with limited connectivity

Diego Goldsztajn, Andres Ferragut

We consider processing networks where multiple dispatchers are connected to single-server queues by a bipartite compatibility graph, modeling constraints that are common in data ce…

math.PR2024

Optimal local storage policy based on stochastic intensities and its large scale behavior

Matias Carrasco, Andres Ferragut, Fernando Paganini

In this paper, we analyze the optimal management of local memory systems, using the tools of stationary point processes. We provide a rigorous setting of the problem, building upon…

math.OC2024

Dynamics and Optimization in Spatially Distributed Electrical Vehicle Charging

Fernando Paganini, Andres Ferragut

We consider a spatially distributed demand for electrical vehicle recharging, that must be covered by a fixed set of charging stations. Arriving EVs receive feedback on transport t…

eess.SY2020

Quadratic approximate dynamic programming for scheduling water resources: a case study

Agustin Castellano, Camila Martínez, Pablo Monzón +3

We address the problem of scheduling water resources in a power system via approximate dynamic programming.To this goal, we model a finite horizon economic dispatch problemwith con…

math.OC2020

Minimal-Variance Distributed Deadline Scheduling

Yorie Nakahira, Andres Ferragut, Adam Wierman

Many modern schedulers can dynamically adjust their service capacity to match the incoming workload. At the same time, however, unpredictability and instability in service capacity…