1 citations · 2 across the 20 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.DS2022
Online Matching with Set and Concave Delays
Lindsey Deryckere, Seeun William Umboh
We initiate the study of online problems with set delay, where the delay cost at any given time is an arbitrary function of the set of pending requests. In particular, we study the…
cs.DS2022
Nested Active-Time Scheduling
Nairen Cao, Jeremy T. Fineman, Shi Li +3
The active-time scheduling problem considers the problem of scheduling preemptible jobs with windows (release times and deadlines) on a parallel machine that can schedule up to …