arXiv (All)
open access
Multidimensional Resource Scheduling with Small Demands
We study multidimensional resource scheduling. Each job $i$ has a $d$-dimensional resource-demand vector $v_i$ and a processing time $s_i$. The scheduler assigns a start time to each job, subject to the constraint that, at every time, the total demand of the jobs being processed does not exceed $1$
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Better Late Than Never: Online Flow Time Scheduling with Online Estimates#984328
- Contribution to the design of distributed virtual-time based scheduling algorithms#448525
- Research and Development (R&D): Stochastic All-Pay Auctions#347575
- Distributed Continuous-Time Optimization on the Special Orthogonal Group SO(3) over Tree Interaction Graphs#1033811
- A Quantitative Measure Of Fairness And Discrimination For Resource Allocation In Shared Computer Systems#6601
Record · ID 1144316
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive