On the power of randomization for job shop scheduling with $k$-units length tasks

Mömke, Tobias

doi:10.1051/ita:2008024

On the power of randomization for job shop scheduling with

k

-units length tasks

Mömke, Tobias

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 43 (2009) no. 2, pp. 189-207.

Résumé

In the job shop scheduling problem $k$ -units- $J_{m}$ , 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 $d = o (\sqrt{D})$ 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- $J_{m}$ is presented. This is the on-line algorithm with the best known competitive ratio against an oblivious adversary for $d = o (\sqrt{D})$ 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- $J_{m}$ , whereas the competitive ratio of the randomized on-line algorithm of (ii) still tends to 1 for $d = o (\sqrt{D})$ .

MR Zbl | 1 citation dans Numdam

DOI : 10.1051/ita:2008024

Classification : 68W20, 68W25
Mots-clés : on-line algorithms, randomization, competitive ratio, scheduling

@article{ITA_2009__43_2_189_0,
     author = {M\"omke, Tobias},
     title = {On the power of randomization for job shop scheduling with $k$-units length tasks},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {189--207},
     publisher = {EDP-Sciences},
     volume = {43},
     number = {2},
     year = {2009},
     doi = {10.1051/ita:2008024},
     mrnumber = {2512254},
     zbl = {1166.68041},
     language = {en},
     url = {http://www.numdam.org/articles/10.1051/ita:2008024/}
}

TY  - JOUR
AU  - Mömke, Tobias
TI  - On the power of randomization for job shop scheduling with $k$-units length tasks
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 2009
SP  - 189
EP  - 207
VL  - 43
IS  - 2
PB  - EDP-Sciences
UR  - http://www.numdam.org/articles/10.1051/ita:2008024/
DO  - 10.1051/ita:2008024
LA  - en
ID  - ITA_2009__43_2_189_0
ER  -

%0 Journal Article
%A Mömke, Tobias
%T On the power of randomization for job shop scheduling with $k$-units length tasks
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 2009
%P 189-207
%V 43
%N 2
%I EDP-Sciences
%U http://www.numdam.org/articles/10.1051/ita:2008024/
%R 10.1051/ita:2008024
%G en
%F ITA_2009__43_2_189_0

Mömke, Tobias. On the power of randomization for job shop scheduling with $k$-units length tasks. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 43 (2009) no. 2, pp. 189-207. doi : 10.1051/ita:2008024. http://www.numdam.org/articles/10.1051/ita:2008024/

Bibliographie
Cité par

[1] P. Brucker, An efficient algorithm for the job shop problem with two jobs. Computing 40 (1988) 353-359. | MR | Zbl

[2] U. Feige and C. Scheideler, Improved bounds for acyclic job shop scheduling. Combinatorica 22 (2002) 361-399. | MR

[3] J. Hromkovič, K. Steinhöfel and P. Widmayer, Job shop scheduling with unit length tasks: bounds and algorithms. ICTCS '01: Proceedings of the 7th Italian Conference on Theoretical Computer Science. Lect. Notes Comput. Sci. 2202 (2001) 90-106. | MR | Zbl

[4] J. Hromkovič, T. Mömke, K. Steinhöfel and P. Widmayer, Job shop scheduling with unit length tasks: bounds and algorithms. Algorithmic Operations Research 2 (2007) 1-14. | MR

[5] F.A. Leighton, B.M. Maggs and S.B. Rao, Packet routing and job shop scheduling in $O (congestion + dilition)$ steps. Combinatorica 14 (1994) 167-186. | MR | Zbl

[6] F.A. Leighton, B.M. Maggs and A.W. Richa, Fast algorithms for finding $O (congestion + dilation)$ packet routing schedules. Combinatorica 19 (1999) 375-401. | MR | Zbl

[7] J.K. Lenstra and A.H.G. Rinnooy Kan, Computational complexity of discrete optimization problems. Annals of Discrete Mathematics 4 (1979) 121-140. | MR | Zbl

[8] D.P. Willamson, L.A. Hall, C.A.J. Hurkens, J.K. Lenstra, S.V. Sevast'Janov and D.B. Shmoys, Short shop schedules. Operations Research 45 (1997) 288-294. | MR | Zbl

Cité par Sources :