scientific article; zbMATH DE number 1962819

zbMATH Open1035.68504MaRDI QIDQ4418655FDOQ4418655

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

Publication date: 11 August 2003

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

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

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

Cited In (8)

• Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines
• Delay-bounded scheduling without delay!
• Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines
• Scheduling search procedures: The wheel of fortune
• Non-clairvoyant scheduling for weighted flow time
• Non-clairvoyant scheduling for minimizing mean slowdown
• 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)