scientific article; zbMATH DE number 7204483

DOI10.4230/LIPICS.ICALP.2017.31zbMATH Open1441.68287MaRDI QIDQ5111361FDOQ5111361

Julie Meißner, Andreas Wiese, José Verschae, Antonios Foivos Antoniadis, Ruben Hoeksma

Publication date: 27 May 2020

Title of this publication is not available (Why is that?)

Recommendations

• How unsplittable-flow-covering helps scheduling with job-dependent cost functions
• How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions
• The geometry of scheduling
• Optimal algorithms and a PTAS for cost-aware scheduling
• Scheduling jobs on identical and uniform processors revisited

zbMATH Keywords

unsplittable flowsQPTASgeneralized scheduling

Mathematics Subject Classification ID

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

Cited In (3)

• Title not available (Why is that?)
• An Optimal Control Framework for Online Job Scheduling with General Cost Functions
• Fixed-parameter algorithms for unsplittable flow cover

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111361)