arXiv (All)
open access
Approximation algorithms for identical parallel machine scheduling with assignment costs
We study non-preemptive scheduling on identical parallel machines in which assigning job $j$ to machine $M_i$ incurs the cost $c_{ij}=a_iw_j+b_j$. The processing times $p_j$ and the cost weights $w_j$ are independent, and the number of machines is part of the input. For every fixed $\varepsilon\in(0
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
- Sharp Limits for Honest Uncertainty in Hard-Budget Repeated Evaluation#1077069
- Load Balancing with Evolving Workloads in Large-Scale Language Model Serving#1389174
- Batched Feedback and the Random-Access Wall in Search-Based Graph Construction#1108876
- Batched Feedback and the Random-Access Wall in Search-Based Graph Construction#1104692
- Machines Infringing on Copyright : Liability and Justifications in Machine Learning#1181248
Record · ID 1456489
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