arXiv (OAI Expanded)
open access
Scheduling to Maximize Weighted Throughput with an Active-Time Budget
We study the active-time scheduling problem with weighted throughput maximization. In this setting, a set of $n$ jobs $J$ arrive at integer release times, each with an integer processing time and integer deadline. Jobs may be preempted at integer time slot boundaries. A schedule assigns jobs to time
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
- Scheduling to Maximize Weighted Throughput with an Active-Time Budget#794208
- Parametric maximum closure on precedence forests#1061737
- Coupled-task scheduling with time windows, bounded pathwidth and bounded slack is para-NP-complete#129474
- Weighted cost emission dispatch optimization using GA-APO hybridization under priority sensitive scheduling for thermal power systems.#13393
- On a real-time scheduling problem#490179
Record · ID 790189
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