Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
A Simpler Proof of Preemptive Total Flow Time Approximation on Parallel Machines - MaRDI portal

A Simpler Proof of Preemptive Total Flow Time Approximation on Parallel Machines

From MaRDI portal

Publication:5450808

Jump to:navigation, search

DOI10.1007/11671541_7zbMath1132.90328OpenAlexW1557138207MaRDI QIDQ5450808

Stefano Leonardi

Publication date: 14 March 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11671541_7

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Approximation algorithms (68W25)

Related Items (2)

Semi-clairvoyant scheduling ⋮ Approximating total flow time on parallel machines

This page was built for publication: A Simpler Proof of Preemptive Total Flow Time Approximation on Parallel Machines

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5450808&oldid=20218537"