Sciweavers

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

108

MOR
2006

90views more MOR 2006»

Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems

15 years 2 months ago

Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems

Download www.cs.ucla.edu

Julia Chuzhoy, Rafail Ostrovsky, Yuval Rabani

Real-time Traffic

MOR 2006 |

claim paper

Related Content

» Simple Algorithms for a Weighted Interval Selection Problem

» Approximation Algorithms for Scheduling Multiple Feasible Interval Jobs

» A Diversity Study in Genetic Algorithms for Job Shop Scheduling Problems

» Approximating the Noncontiguous Multiple Organization Packing Problem

» Minimizing total busy time in parallel scheduling with application to optical networks

» Scheduling Algorithms for Procrastinators

» Minimizing Busy Time in Multiple Machine Realtime Scheduling

» Resource Minimization Job Scheduling

» Preemptive Scheduling with Rejection

Post Info
More Details (n/a)

Added	14 Dec 2010
Updated	14 Dec 2010
Type	Journal
Year	2006
Where	MOR
Authors	Julia Chuzhoy, Rafail Ostrovsky, Yuval Rabani

Comments (0)