scientific article; zbMATH DE number 1962819

MaRDI QIDQ4418655zbMATH OpenFDO

Authors N. Bansal, Kedar Dhamdhere, Jochen Könemann, Amitabh Sinha

Publication date 11 August 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2607/26070260.htm

Mathematics Subject Classification ID

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

Recommendations

• Non-clairvoyant scheduling for minimizing mean slowdown
• scientific article; zbMATH DE number 437567
• Minimizing flow time nonclairvoyantly
• Nonclairvoyant scheduling
• scientific article; zbMATH DE number 1383710

Cited in

(9)

• Delay-bounded scheduling without delay!
• Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines
• Non-clairvoyantly scheduling to minimize convex functions
• Scheduling search procedures: The wheel of fortune
• Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines
• Non-clairvoyant scheduling for minimizing mean slowdown
• Non-clairvoyant scheduling for weighted flow time
• Graceful Degradation in Semi-Clairvoyant Scheduling
• Optimal on-line algorithms to minimize makespan on two machines with resource augmentation

This page was built for publication:

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