scientific article; zbMATH DE number 437567

MaRDI QIDQ3140446zbMATH OpenFDO

Authors Steven J. Phillips, Eric Torng, Rajeev Motwani

Publication date 15 December 1993

zbMATH Keywords

non-clairvoyant schedulingpreemptive scheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Nonclairvoyant scheduling
• Speed is more powerful than clairvoyance
• scientific article; zbMATH DE number 1559528
• scientific article; zbMATH DE number 1383710
• Scheduling in the dark

Cited in

(17)

• Non-clairvoyant scheduling for weighted flow time
• Minimizing average completion time in the presence of release dates
• Nonclairvoyant scheduling
• Semi-clairvoyant scheduling
• Non-clairvoyant multiprocessor scheduling of jobs with changing execution characteristics
• Utilization of nonclairvoyant online schedules
• Minimizing flow time nonclairvoyantly
• scientific article; zbMATH DE number 1962819 (Why is no real title available?)
• scientific article; zbMATH DE number 2080043 (Why is no real title available?)
• scientific article; zbMATH DE number 1383710 (Why is no real title available?)
• Speed is more powerful than clairvoyance
• Scheduling jobs that arrive over time
• On-line scheduling of parallel jobs
• On-line load balancing for related machines
• Semi-clairvoyant scheduling
• Scheduling in the dark
• Improved results for scheduling batched parallel jobs by using a generalized analysis framework

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 Q3140446)