Image de couverture de livre

Online busy time scheduling with flexible jobs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Albers, Susanne, van der Heijden, G. Wessel
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Online $b$-Matching with Stochastic Rewards
par: Albers, Susanne, et autres
Publié: (2024)

A simpler QPTAS for scheduling jobs with precedence constraints
par: Das, Syamantak, et autres
Publié: (2025)

Stochastic scheduling with Bernoulli-type jobs through policy stratification
par: Antoniadis, Antonios, et autres
Publié: (2025)

On the 2D Demand Bin Packing Problem: Hardness and Approximation Algorithms
par: Albers, Susanne, et autres
Publié: (2025)

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

A $(2+\varepsilon)$-approximation algorithm for the general scheduling problem in quasipolynomial time
par: Armbruster, Alexander, et autres
Publié: (2025)

Speed-robust scheduling revisited
par: Minařík, Josef, et autres
Publié: (2024)

Exponentially faster fixed-parameter algorithms for high-multiplicity scheduling
par: Fischer, David, et autres
Publié: (2022)

Scheduling two types of jobs with minimum makespan
par: Cao, Song, et autres
Publié: (2024)

Online matching with delays and stochastic arrival times
par: Mari, Mathieu, et autres
Publié: (2022)

Improved algorithms for single machine serial-batch scheduling to minimize makespan and maximum cost
par: Li, Shuguang, et autres
Publié: (2025)

Near-real-time Solutions for Online String Problems
par: Köppl, Dominik, et autres
Publié: (2026)

Tight Bounds for Sorting Under Partial Information
par: van der Hoog, Ivor, et autres
Publié: (2024)

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

Learning on the Edge: Online Learning with Stochastic Feedback Graphs
par: Esposito, Emmanuel, et autres
Publié: (2022)

Optimizing Periodic Operations for Efficient Inland Waterway Lock Management
par: Golak, Julian, et autres
Publié: (2025)

Simpler Optimal Sorting from a Directed Acyclic Graph
par: van der Hoog, Ivor, et autres
Publié: (2024)

Tight Better-Than-Worst-Case Bounds for Element Distinctness and Set Intersection
par: van der Hoog, Ivor, et autres
Publié: (2025)

Simpler Universally Optimal Dijkstra
par: van der Hoog, Ivor, et autres
Publié: (2025)

Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization
par: Nikolov, Aleksandar, et autres
Publié: (2026)

Near-Optimal Heaps and Dijkstra on Pointer Machines
par: van der Hoog, Ivor, et autres
Publié: (2026)

A polynomial delay algorithm generating all potential maximal cliques in triconnected planar graphs
par: Grigoriev, Alexander, et autres
Publié: (2025)

A probabilistic analysis on general probabilistic scheduling problems
par: Suruga, Daiki
Publié: (2024)

Online String Attractors
par: Whittington, Philip
Publié: (2024)

Online Unbounded Knapsack
par: Böckenhauer, Hans-Joachim, et autres
Publié: (2024)

Improved Online Sorting
par: Nirjhor, Jubayer, et autres
Publié: (2025)

Online Metric TSP
par: Bertram, Christian
Publié: (2025)

Improved Online Reachability Preservers
par: Bodwin, Greg, et autres
Publié: (2024)

Dependency-Aware Online Caching
par: Dallot, Julien, et autres
Publié: (2024)

The Online Submodular Assignment Problem
par: Hathcock, Daniel, et autres
Publié: (2024)

Risk-Sensitive Online Algorithms
par: Christianson, Nicolas, et autres
Publié: (2024)

The Online Submodular Assignment Problem
par: Hathcock, Daniel, et autres
Publié: (2024)

Online Monotone Metric Embeddings
par: Coester, Christian, et autres
Publié: (2026)

The Online Submodular Cover Problem
par: Gupta, Anupam, et autres
Publié: (2025)

Online Knapsack Problems with Estimates
par: Balabán, Jakub, et autres
Publié: (2025)

Online Firefighting on Cactus Graphs
par: Hugen, Max, et autres
Publié: (2025)

Online Computation with Untrusted Advice
par: Angelopoulos, Spyros, et autres
Publié: (2019)

Online Bisection with Ring Demands
par: Basiak, Mateusz, et autres
Publié: (2026)

Online Facility Assignments on Polygons
par: Malik, Sumaiya, et autres
Publié: (2025)

Online Steiner Forest with Recourse
par: Long, Yaowei, et autres
Publié: (2026)