arXiv (All)
open access
A QPTAS for Stochastic Scheduling of Bernoulli Jobs
We study the classical problem of scheduling jobs with random processing times on $m$ identical machines to minimize the expected sum of completion times, for Bernoulli jobs: job $j$ takes time $p_j$ with probability $q_j$ and time $0$ otherwise, and its outcome is revealed when it starts. The bench
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
- Rozbudowa zasobów obliczeniowych Laboratorium Mechaniki Komputerowej Wydziału Mechanicznego Politechniki Opolskiej oraz rozszerzenie licencji Ansys Workbench o licencję komercyjną.#291464
- Rozbudowa zasobów obliczeniowych Laboratorium Mechaniki Komputerowej Wydziału Mechanicznego Politechniki Opolskiej oraz rozszerzenie licencji Ansys Workbench o licencję komercyjną.#291463
- Complexity Amplification from Compression in Quantum Random Access Optimization#975154
- Robust scheduling with stochastic processing times in flexible job-shops#1166361
- Best-of-Both Worlds for linear contextual bandits with paid observations#986160
Record · ID 1248761
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