Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

ESA
2007
Springer

favoriteEmaildiscussreport

131views Algorithms» more ESA 2007»

Online Scheduling of Equal-Length Jobs on Parallel Machines

13 years 10 months ago

Online Scheduling of Equal-Length Jobs on Parallel Machines

Download www.math.cas.cz

We study on-line scheduling of equal-length jobs on parallel machines. Our main result is an algorithm with competitive ratio de

Jihuan Ding, Tomás Ebenlendr, Jiri Sgall, G

Real-time Traffic

Competitive Ratio | ESA 2007 | On-line Scheduling | Parallel Machines |

claim paper

Related Content

» Online scheduling of weighted equallength jobs with hard deadlines on parallel machines

» Online Scheduling of EqualLength Jobs Randomization and Restarts Help

» Preemptive MultiMachine Scheduling of EqualLength Jobs to Minimize the Average Flow Time

» Dispatching EqualLength Jobs to Parallel Machines to Maximize Throughput

» Preemptive Scheduling of EqualLength Jobs in Polynomial Time

» Online scheduling of parallel jobs on two machines

» Stochastic Online Scheduling on Parallel Machines

» Special Cases of Online Parallel Job Scheduling

» Online scheduling of parallel jobs on two machines is 2competitive

Post Info
More Details (n/a)

Added	07 Jun 2010
Updated	07 Jun 2010
Type	Conference
Year	2007
Where	ESA
Authors	Jihuan Ding, Tomás Ebenlendr, Jiri Sgall, Guochuan Zhang

Comments (0)