arXiv (All)
open access
Minimizing the Weighted Makespan with Restarts on a Single Machine
We consider the problem of minimizing the weighted makespan on a single machine with restarts. Restarts are similar to preemptions but weaker: a job can be interrupted, but then it has to be run again from the start instead of resuming at the point of interruption later. The objective is to minimize
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
- DP18625: Process Utility in High-Stakes Competition#175465
- Identifying Panel Conditioning with Refreshment Samples: Sharp Bounds and Design Assumptions#1156925
- The Limits of Speculation: Bounding Speculative Decoding in Mixture-of-Experts#1036839
- DrainSinkhorn: Safe Elimination for Batched Entropic Optimal Transport#926138
- Comments on the Usefulness of Simple Best-Effort Traffic#449110
Record · ID 1216192
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