Name
Abstract | ||
|---|---|---|
We consider an online scheduling problem where jobs arrive over time. A set of independent jobs has to be scheduled on two parallel machines, where preemption is not allowed and the number of jobs is unknown in advance. The characteristics of each job, i.e., processing time and delivery time, become known at its release time. Each job is delivered to the destination independently and immediately at its completion time on the machines. The objective is to minimize the time by which all jobs have been delivered. We present an online algorithm which has a competitive ratio of (1 + √5)/2 ≈ 1.618. © Springer International Publishing 2013. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-319-03780-6_9 | COCOA |
Keywords | Field | DocType |
Delivery times,Online algorithm,Parallel machines,Scheduling | Discrete mathematics,Online algorithm,Preemption,Job shop scheduling,Approx,Scheduling (computing),Computer science,Parallel computing,Distributed computing,Competitive analysis | Conference |
Volume | Issue | ISSN |
8287 LNCS | null | 16113349 |
Citations | PageRank | References |
0 | 0.34 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Peihai Liu | 1 | 52 | 6.01 |
| Xiwen Lu | 2 | 182 | 21.03 |