arXiv (All)
open access
Online Job Assignment
Motivated primarily by applications in cloud computing, we study a simple, yet powerful, online allocation problem in which jobs of varying durations arrive over continuous time and must be assigned immediately and irrevocably to one of the available offline servers. Each server has a fixed initial
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
- Algorithms for rescheduling jobs with a LIFO buffer to minimize the weighted number of late jobs#274657
- A Robustified Greedy Algorithm for Online Transportation with Improved Competitive Guarantees#1144019
- On a real-time scheduling problem#490179
- Improved Analysis of Adaptive Task Allocation and Non-Stationary Processing Times#1343780
- CloudyGUI: A Novel Python-based Framework for Auto-Scaling and Cloud Workload Analysis#329058
Record · ID 1342326
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