#### Filter Results:

#### Publication Year

2006

2009

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

We study on-line scheduling of equal-length jobs on parallel machines. Our main result is an algorithm with competitive ratio decreasing to e/(e − 1) ≈ 1.58 as the number of machine increases. For m ≥ 3, this is the first algorithm better than 2-competitive greedy algorithm. Our algorithm has an additional property called immediate decision: at each time,… (More)

We investigate the problem of on-line scheduling for jobs with arbitrary release times on m identical parallel machines. The goal is to minimize the makespan. We derive a best possible online algorithm with competitive ratio of 2 for m = 2. For a special case that all the jobs have unit processing times, we prove that Algorithm LS has a tight bound of 3/2… (More)

- ‹
- 1
- ›