Geodesic
Job shop scheduling with unit length tasks
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 46 (2012) no. 3, pp. 329-342 Cet article a éte moissonné depuis la source Numdam

Voir la notice de l'article

In this paper, we consider a class of scheduling problems that are among the fundamental optimization problems in operations research. More specifically, we deal with a particular version called job shop scheduling with unit length tasks. Using the results of Hromkovič, Mömke, Steinhöfel, and Widmayer presented in their work Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms, we analyze the problem setting for 2 jobs with an unequal number of tasks. We contribute a deterministic algorithm which achieves a vanishing delay in certain cases and a randomized algorithm with a competitive ratio tending to 1. Furthermore, we investigate the problem with 3 jobs and we construct a randomized online algorithm which also has a competitive ratio tending to 1.

DOI : 10.1051/ita/2011132
Classification : 68Q25
Keywords: online algorithms, competitive analysis, job shop scheduling 
@article{ITA_2012__46_3_329_0,
     author = {Akveld, Meike and Bernhard, Raphael},
     title = {Job shop scheduling with unit length tasks},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {329--342},
     year = {2012},
     publisher = {EDP-Sciences},
     volume = {46},
     number = {3},
     doi = {10.1051/ita/2011132},
     mrnumber = {2981673},
     zbl = {1283.68158},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.1051/ita/2011132/}
}
TY  - JOUR
AU  - Akveld, Meike
AU  - Bernhard, Raphael
TI  - Job shop scheduling with unit length tasks
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 2012
SP  - 329
EP  - 342
VL  - 46
IS  - 3
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/articles/10.1051/ita/2011132/
DO  - 10.1051/ita/2011132
LA  - en
ID  - ITA_2012__46_3_329_0
ER  - 
%0 Journal Article
%A Akveld, Meike
%A Bernhard, Raphael
%T Job shop scheduling with unit length tasks
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 2012
%P 329-342
%V 46
%N 3
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/articles/10.1051/ita/2011132/
%R 10.1051/ita/2011132
%G en
%F ITA_2012__46_3_329_0
Akveld, Meike; Bernhard, Raphael. Job shop scheduling with unit length tasks. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 46 (2012) no. 3, pp. 329-342. doi: 10.1051/ita/2011132

Cité par Sources :