Imagen de Portada

The Buffer Minimization Problem for Scheduling Flow Jobs with Conflicts

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Haas, Niklas, Schmitt, Sören, van Stee, Rob
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

Improved online load balancing with known makespan
por: Böhm, Martin, et al.
Publicado: (2024)

Minimizing the Weighted Makespan with Restarts on a Single Machine
por: Amouzandeh, Aflatoun, et al.
Publicado: (2025)

Online Flow Time Minimization with Gradually Revealed Jobs
por: Lindermayr, Alexander, et al.
Publicado: (2026)

Temporal Routing in Static Networks: The Schedule Completion Problem
por: Döring, Michelle, et al.
Publicado: (2026)

Online Scheduling via Gradient Descent for Weighted Flow Time Minimization
por: Chen, Qingyun, et al.
Publicado: (2024)

Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates
por: Kaul, Matthias, et al.
Publicado: (2024)

Scheduling Jobs with Work-Inefficient Parallel Solutions
por: Kuszmaul, William, et al.
Publicado: (2024)

Job Scheduling under Base and Additional Fees, with Applications to Mixed-Criticality Scheduling
por: Hsieh, Yi-Ting, et al.
Publicado: (2025)

Algorithmic Reductions: Network Flow and NP-Completeness in Real-World Scheduling Problems
por: Sinhal, Anay, et al.
Publicado: (2026)

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

Global Predecessor Indexing: Avoiding Binary Search in Weighted Job Scheduling
por: Joshi, Amit
Publicado: (2025)

A Practical 73/50 Approximation for Contiguous Monotone Moldable Job Scheduling
por: Jansen, Klaus, et al.
Publicado: (2026)

Minimizing the Number of Tardy Jobs with Uniform Processing Times on Parallel Machines
por: Heeger, Klaus, et al.
Publicado: (2024)

Crane Scheduling Problem with Energy Saving
por: Gao, Yixiong, et al.
Publicado: (2025)

Scheduling Multi-Server Jobs is Not Easy
por: Vaze, Rahul
Publicado: (2024)

Finite Pinwheel Scheduling: the k-Visits Problem
por: Kanellopoulos, Sotiris, et al.
Publicado: (2025)

Weighted Chairman Assignment and Flow-Time Scheduling
por: Liu, Siyue, et al.
Publicado: (2025)

Buffered Streaming Edge Partitioning
por: Chhabra, Adil, et al.
Publicado: (2024)

Minimizing the Number of Tardy Jobs and Maximal Tardiness on a Single Machine is NP-hard
por: Heeger, Klaus, et al.
Publicado: (2024)

Tighter Bounds on Non-clairvoyant Parallel Machine Scheduling with Prediction to Minimize Makespan
por: Chen, Tianqi, et al.
Publicado: (2025)

A Note on Interdiction of Linear Minimization Problems
por: Cong, Yu, et al.
Publicado: (2026)

Packing-Inspired Algorithms for Periodic Scheduling Problems with Harmonic Periods
por: Grus, Josef, et al.
Publicado: (2024)

A Simpler Analysis for $\varepsilon$-Clairvoyant Flow Time Scheduling
por: Gupta, Anupam, et al.
Publicado: (2026)

Comparing the Hardness of Online Minimization and Maximization Problems with Predictions
por: Berg, Magnus
Publicado: (2024)

Minimizing $\ell_2$ Norm of Flow Time by Starvation Mitigation
por: Kuo, Tung-Wei
Publicado: (2021)

Online Algorithms to Schedule a Proportionate Flexible Flow Shop of Batching Machines
por: Hertrich, Christoph, et al.
Publicado: (2020)

Delayed-Clairvoyant Flow Time Scheduling via a Borrow Graph Analysis
por: Lindermayr, Alexander, et al.
Publicado: (2026)

Approximation algorithms for Job Scheduling with reconfigurable resources
por: Bergé, Pierre, et al.
Publicado: (2023)

Online Flow Time Minimization: Tight Bounds for Non-Preemptive Algorithms
por: Geng, Yutong, et al.
Publicado: (2025)

The Parameterized Complexity Landscape of the Unsplittable Flow Problem
por: Ganian, Robert, et al.
Publicado: (2024)

Minimizing the Weighted Number of Tardy Jobs is W[1]-hard
por: Heeger, Klaus, et al.
Publicado: (2024)

Scheduling Problems with Constrained Rejections
por: Davies, Sami, et al.
Publicado: (2025)

Total Completion Time Scheduling Under Scenarios
por: Bosman, Thomas, et al.
Publicado: (2024)

DAG Projections: Reducing Distance and Flow Problems to DAGs
por: Haeupler, Bernhard, et al.
Publicado: (2026)

Budget-feasible Egalitarian Allocation of Conflicting Jobs
por: Gupta, Sushmita, et al.
Publicado: (2024)

PACE Solver Description: Exact Solution of the One-sided Crossing Minimization Problem by the MPPEG Team
por: Jünger, Michael, et al.
Publicado: (2024)

Equivalent Instances for Scheduling and Packing Problems
por: Jansen, Klaus, et al.
Publicado: (2025)

Lower Bound Techniques in the Comparison-Query Model and Inversion Minimization on Trees
por: Hu, Ivan, et al.
Publicado: (2022)

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

Updating Lower and Upper Bounds for the Job-Shop Scheduling Problem Test Instances
por: Graviers, Marc-Emmanuel Coupvent des, et al.
Publicado: (2025)