Minimizing Average Flow-Time (Q3644722)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Minimizing Average Flow-Time	scientific article

Statements

scholarly article

0 references

Minimizing Average Flow-Time (English)

0 references

0 references

Lecture Notes in Computer Science

0 references

publication date

12 November 2009

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-642-03456-5_13

0 references

Minimizing total flow time and total completion time with immediate dispatching

0 references

Minimizing the flow time without migration

0 references

0 references

A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentation

0 references

Approximation schemes for preemptive weighted flow time

0 references

Algorithms for minimizing weighted flow time

0 references

On the single-source unsplittable flow problem

0 references

Better Algorithms for Minimizing Average Flow-Time on Related Machines

0 references

Minimizing average flow time on related machines

0 references

Minimizing Total Flow-Time: The Unrelated Case

0 references

0 references

Nonclairvoyant scheduling

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-642-03456-5_13

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3644722

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3644722&oldid=35137123"