scientific article; zbMATH DE number 1894930

MaRDI QIDQ4801952zbMATH OpenFDO

Authors Zhiyi Tan, Yong He

Publication date 8 April 2003

zbMATH Keywords

lower boundworst-case ratioon-line scheduling

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36)

Recommendations

• Approximation algorithms for scheduling unrelated parallel machines
• Randomized On-line Scheduling of Parallel Jobs
• Approximation schemes for scheduling on parallel machines
• Publication:4942231
• scientific article; zbMATH DE number 947476
• Approximation results in parallel machines stochastic scheduling
• Barely random algorithms for multiprocessor scheduling
• Approximating scheduling unrelated parallel machines in parallel

Cited in

(7)

• Randomized on-line and semi-on-line scheduling on identical machines
• A lower bound for randomized on-line scheduling algorithms
• scientific article; zbMATH DE number 947476 (Why is no real title available?)
• Scheduling Unrelated Machines by Randomized Rounding
• New Scheduling Strategies for Randomized Incremental Algorithms in the Context of Speculative Parallelization
• Parallel execution of schedules with random dependency graph
• scientific article; zbMATH DE number 5629900 (Why is no real title available?)

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