scientific article

DOI10.4086/toc.2016.v012a014zbMath1391.90239OpenAlexW2584754195MaRDI QIDQ2830868

Bouke Cloostermans, Nikhil Bansal

Publication date: 1 November 2016

Published in: Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4086/toc.2016.v012a014

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

zbMATH Keywords

approximation algorithmonline algorithmmaximum flow-time minimizationrelated machines scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Related Items (2)

Minimizing the maximum flow time in the online food delivery problem ⋮ Minimizing Maximum Flow Time on Related Machines via Dynamic Posted Pricing

Cites Work

• On-line scheduling to minimize Max flow time: an optimal preemptive algorithm

This page was built for publication: