How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions

DOI10.1007/978-3-662-43948-7_52zbMath1386.90055OpenAlexW1554636509MaRDI QIDQ5167778

Wiebke Höhn, Andreas Wiese, Julián Mestre

Publication date: 1 July 2014

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: http://depositonce.tu-berlin.de/handle/11303/6663

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items (6)

A Water-Filling Primal-Dual Algorithm for Approximating NonLinear Covering Problems ⋮ The TV advertisements scheduling problem ⋮ Unnamed Item ⋮ Primal-dual and dual-fitting analysis of online scheduling algorithms for generalized flow-time problems ⋮ A polynomial-time approximation scheme for the airplane refueling problem ⋮ A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems

This page was built for publication: How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions