scientific article; zbMATH DE number 2079378

zbMath1092.68540MaRDI QIDQ4471337

Nikhil Bansal, Kedar Dhamdhere

Publication date: 28 July 2004

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

zbMATH Keywords

online algorithm

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (10)

Online weighted flow time and deadline scheduling ⋮ Approximating total flow time on parallel machines ⋮ Scheduling and fixed-parameter tractability ⋮ A best possible online algorithm for minimizing the total completion time and the total soft penalty cost ⋮ Greedy multiprocessor server scheduling ⋮ How unsplittable-flow-covering helps scheduling with job-dependent cost functions ⋮ Non-clairvoyant scheduling for weighted flow time ⋮ From Preemptive to Non-preemptive Scheduling Using Rejections ⋮ Minimizing Average Flow-Time ⋮ Non-clairvoyant weighted flow time scheduling on different multi-processor models

This page was built for publication: