Online cardinality constrained scheduling
From MaRDI portal
Publication:6556169
DOI10.1016/j.orl.2023.08.003MaRDI QIDQ6556169
Asaf Levin, Leah Epstein, Lars Rohwedder, Marten Maack, Alexandra Lassota
Publication date: 17 June 2024
Published in: Operations Research Letters (Search for Journal in Brave)
Cites Work
- A 3/2-approximation algorithm for \(k_i\)-partitioning
- Approximating vector scheduling: almost matching upper and lower bounds
- Lower bounds and heuristic algorithms for the \(k_i\)-partitioning problem
- On-line scheduling revisited
- \(\kappa\)-partitioning problems for maximizing the minimum load
- Algorithms for on-line bin-packing problems with cardinality constraints
- Ordinal algorithms for parallel machine scheduling
- Optimal matroid partitioning problems
- Online bin packing with cardinality constraints resolved
- Bounds for online bin packing with cardinality constraints
- An Efficient PTAS for Parallel Machine Scheduling with Capacity Constraints
- Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems
- Better Bounds for Online Scheduling
- Online Bin Packing with Cardinality Constraints
- Bounds for Certain Multiprocessing Anomalies
- Bounds for the cardinality constrained \(P \|C_{max}\) problem
- Cardinality constrained scheduling in online models
Related Items (2)
Online early work scheduling on parallel machines ⋮ Tighter bounds for the harmonic bin packing algorithm
This page was built for publication: Online cardinality constrained scheduling
