1 paper · 1 filter
Rahul Vaze, Jayakrishnan Nair
An online non-convex optimization problem is considered where the goal is to minimize the flow time (total delay) of a set of jobs by modulating the number of active servers, but w…