scientific article; zbMATH DE number 7561579

DOI10.4230/LIPIcs.ICALP.2019.86MaRDI QIDQ5091246

Benjamin Moseley

Publication date: 21 July 2022

Full work available at URL: https://arxiv.org/abs/1904.09667

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

schedulingapproximation algorithmsLP rounding

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Related Items (3)

An Optimal Control Framework for Online Job Scheduling with General Cost Functions ⋮ A Water-Filling Primal-Dual Algorithm for Approximating NonLinear Covering Problems ⋮ Fair Scheduling via Iterative Quasi-Uniform Sampling

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Valid inequalities for mixed 0-1 programs
• Single machine scheduling to minimize total weighted tardiness
• A fully polynomial approximation scheme for the total tardiness problem
• Weighted geometric set cover via quasi-uniform sampling
• A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems
• Approximation Algorithms for the Capacitated Multi-Item Lot-Sizing Problem via Flow-Cover Inequalities
• Fair Scheduling via Iterative Quasi-Uniform Sampling
• On the Performance of Smith’s Rule in Single-Machine Scheduling with Nonlinear Cost
• How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions
• The Geometry of Scheduling
• A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems

This page was built for publication: