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

DOI10.1007/11671541_7MaRDI QIDQ5450808zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Approximating total flow time on parallel machines
• scientific article; zbMATH DE number 1559527
• Online scheduling on identical machines using SRPT
• Minimizing the flow time without migration
• Minimizing the Flow Time Without Migration

Cited in

(5)

• Semi-clairvoyant scheduling
• Approximating total flow time on parallel machines
• Minimizing the flow time without migration
• Minimizing the Flow Time Without Migration
• scientific article; zbMATH DE number 1559527 (Why is no real title available?)

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

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