Showing cs.DSShow all
3 papers · 1 filter
cs.DS2023
Improved Scheduling with a Shared Resource
Christoph Damerius, Peter Kling, Florian Schneider
We consider the following shared-resource scheduling problem: Given a set of jobs , for each we must schedule a job-specific processing volume of . A total resou…
cs.DS2023
Scheduling with a Limited Testing Budget
Christoph Damerius, Peter Kling, Minming Li +2
Scheduling with testing falls under the umbrella of the research on optimization with explorable uncertainty. In this model, each job has an upper limit on its processing time that…
cs.DS2020
On Minimum Generalized Manhattan Connections
Antonios Antoniadis, Margarita Capretto, Parinya Chalermsook +5
We consider minimum-cardinality Manhattan connected sets with arbitrary demands: Given a collection of points in the plane, together with a subset of pairs of points in (wh…