Imagen de Portada

Stochastic scheduling with Bernoulli-type jobs through policy stratification

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Antoniadis, Antonios, Hoeksma, Ruben, Schewior, Kevin, Uetz, Marc
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Stochastic Minimum Spanning Trees with a Single Sample
por: Hoeksma, Ruben, et al.
Publicado: (2024)

Refining the Complexity Landscape of Speed Scaling: Hardness and Algorithms
por: Antoniadis, Antonios, et al.
Publicado: (2025)

Simple Algorithms for Stochastic Score Classification with Small Approximation Ratios
por: Plank, Benedikt M., et al.
Publicado: (2022)

Scheduling on a Stochastic Number of Machines
por: Buchem, Moritz, et al.
Publicado: (2024)

Quickly Determining Who Won an Election
por: Hellerstein, Lisa, et al.
Publicado: (2024)

Non-Adaptive Evaluation of $k$-of-$n$ Functions: Tight Gap and a Unit-Cost PTAS
por: Nielsen, Mads Anker, et al.
Publicado: (2025)

Approximating Matroid Basis Testing for Partition Matroids using Budget-In-Expectation
por: Hellerstein, Lisa, et al.
Publicado: (2026)

Online busy time scheduling with flexible jobs
por: Albers, Susanne, et al.
Publicado: (2024)

Competitive Online Transportation Simplified
por: Arndt, Stephen, et al.
Publicado: (2025)

A simpler QPTAS for scheduling jobs with precedence constraints
por: Das, Syamantak, et al.
Publicado: (2025)

On the Approximability of the Traveling Salesman Problem with Line Neighborhoods
por: Antoniadis, Antonios, et al.
Publicado: (2020)

Threshold Testing and Semi-Online Prophet Inequalities
por: Hoefer, Martin, et al.
Publicado: (2023)

Combinatorial Perpetual Scheduling: Existence and Computation of Low-Height Schedules
por: Mendoza-Cadena, Mirabel, et al.
Publicado: (2026)

Approximation Algorithms for Combinatorial Optimization with Predictions
por: Antoniadis, Antonios, et al.
Publicado: (2024)

Designing Exploration Contracts
por: Hoefer, Martin, et al.
Publicado: (2024)

Scheduling two types of jobs with minimum makespan
por: Cao, Song, et al.
Publicado: (2024)

Breaking the Barrier of 2 for the Competitiveness of Longest Queue Drop
por: Antoniadis, Antonios, et al.
Publicado: (2020)

Speed-robust scheduling revisited
por: Minařík, Josef, et al.
Publicado: (2024)

Forwarding Packets Greedily
por: Boyar, Joan, et al.
Publicado: (2026)

Exponentially faster fixed-parameter algorithms for high-multiplicity scheduling
por: Fischer, David, et al.
Publicado: (2022)

A $(2+\varepsilon)$-approximation algorithm for the general scheduling problem in quasipolynomial time
por: Armbruster, Alexander, et al.
Publicado: (2025)

Improved algorithms for single machine serial-batch scheduling to minimize makespan and maximum cost
por: Li, Shuguang, et al.
Publicado: (2025)

Dependent rounding with strong negative-correlation, and scheduling on unrelated machines to minimize completion time
por: Harris, David G.
Publicado: (2023)

Improved Approximation Algorithms for the Expanding Search Problem
por: Griesbach, Svenja M., et al.
Publicado: (2023)

Real Time Proportional Throughput Maximization: How much advance notice should you give your scheduler?
por: Mottu, Nadim A.
Publicado: (2025)

Minimizing Completion Times of Stochastic Jobs on Parallel Machines is Hard
por: Moseley, Benjamin, et al.
Publicado: (2026)

Stochastic Embedding of Digraphs into DAGs
por: Filtser, Arnold
Publicado: (2025)

A probabilistic analysis on general probabilistic scheduling problems
por: Suruga, Daiki
Publicado: (2024)

An Optimal Algorithm for Stochastic Vertex Cover
por: Brand, Jan van den, et al.
Publicado: (2026)

Identifying Approximate Minimizers under Stochastic Uncertainty
por: Al-Thani, Hessa, et al.
Publicado: (2025)

Adaptivity Gaps for Stochastic Probing with Subadditive Functions
por: Li, Jian, et al.
Publicado: (2025)

Nearly Optimal Bounds for Stochastic Online Sorting
por: Hu, Yang
Publicado: (2025)

Limitations of Stochastic Selection with Pairwise Independent Priors
por: Dughmi, Shaddin, et al.
Publicado: (2023)

First Order Stochastic Optimization with Oblivious Noise
por: Diakonikolas, Ilias, et al.
Publicado: (2024)

Near-Optimal Sparsifiers for Stochastic Knapsack and Assignment Problems
por: Dughmi, Shaddin, et al.
Publicado: (2025)

Stochastic Knapsack: Semi-Adaptivity Gaps and Improved Approximation
por: Barak, Zohar, et al.
Publicado: (2026)

Online Multi-level Aggregation with Delays and Stochastic Arrivals
por: Mari, Mathieu, et al.
Publicado: (2024)

Near-optimal Algorithms for Stochastic Online Bin Packing
por: Ayyadevara, Nikhil, et al.
Publicado: (2022)

Stochastic Traveling Salesperson Problem with Neighborhoods for Object Detection
por: Peng, Cheng, et al.
Publicado: (2024)

Stochastic Optimization and Learning for Two-Stage Supplier Problems
por: Brubach, Brian, et al.
Publicado: (2020)