-
Same authors
-
Related articles
- Recommend this article
- Download citation
- Alert me if this article is cited
- Alert me if this article is corrected
|
||||||||||||||||||
RAIRO-Theor. Inf. Appl. 43, 189-207 (2009)
DOI: 10.1051/ita:2008024
On the power of randomization for job shop scheduling with k-units length tasks
Tobias MömkeDepartment of Informatics, ETH Zurich, ETH Zentrum, 8092 Zürich, Switzerland; tobias.moemke@inf.ethz.ch
Received August 28, 2007. Accepted April 24, 2008. Published online 5 June 2008
Abstract
In the job shop scheduling problem k-units-Jm, there are
m machines and each machine has an integer processing time of at most
k time units. Each job consists of a permutation of m
tasks corresponding to all machines and thus all jobs have an identical
dilation D.
The contribution of this paper are the
following results;
(i) for
jobs and every fixed k, the makespan of
an optimal schedule is at most D+ o(D), which extends the result of [3]
for k=1;
(ii) a randomized on-line approximation algorithm for k-units-Jm is
presented. This is the on-line algorithm with the best known competitive
ratio against an oblivious adversary for
and k > 1;
(iii) different processing times yield harder instances than identical
processing times. There is no 5/3 competitive deterministic on-line
algorithm for k-units-Jm, whereas the competitive ratio of the randomized
on-line algorithm of (ii) still tends to 1 for
.
Mathematics Subject Classification. 68W20, 68W25
Key words: On-line algorithms -- randomization -- competitive ratio -- scheduling
© EDP Sciences 2008
| What is OpenURL? |
- If your librarian has set up your subscription with an OpenURL resolver, OpenURL links appear automatically on the abstract pages.
- You can define your own OpenURL resolver with your EDPS Account. In this case your choice will be given priority over that of your library.
- You can use an add-on for your browser (Firefox or I.E.) to display OpenURL links on a page (see http://www.openly.com/openurlref/). You should disable this module if you wish to use the OpenURL server that you or your library have defined.


Document
BibSonomy
CiteUlike
Connotea
Del.icio.us
Digg
Facebook