Geodesic
An algorithm for solving a certain sequencing problem
Mathematica Applicanda, Tome 10 (1982) no. 18, pp. 59-85.

Voir la notice de l'article provenant de la source Annales Societatis Mathematicae Polonae Series

The authors consider the problem of nonpreemptive scheduling of n tasks in a general job shop. The objective is to find a schedule of minimum length. The algorithm presented in the paper is based on the disjunctive graph approach. Its performance is not compared with other algorithms constructed for that problem.
DOI : 10.14708/ma.v10i18.1523
Classification : 90B35 (68C05)
Mots-clés : Scheduling theory, deterministic, Algorithms 
@article{10_14708_ma_v10i18_1523,
     author = {A. Adrabi\'nski and J. Grabowski and M. Wodecki},
     title = {An algorithm for solving a certain sequencing problem},
     journal = {Mathematica Applicanda},
     pages = { 59--85},
     publisher = {mathdoc},
     volume = {10},
     number = {18},
     year = {1982},
     doi = {10.14708/ma.v10i18.1523},
     language = {pl},
     url = {http://geodesic.mathdoc.fr/articles/10.14708/ma.v10i18.1523/}
}
TY  - JOUR
AU  - A. Adrabiński
AU  - J. Grabowski
AU  - M. Wodecki
TI  - An algorithm for solving a certain sequencing problem
JO  - Mathematica Applicanda
PY  - 1982
SP  -  59
EP  - 85
VL  - 10
IS  - 18
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.14708/ma.v10i18.1523/
DO  - 10.14708/ma.v10i18.1523
LA  - pl
ID  - 10_14708_ma_v10i18_1523
ER  - 
%0 Journal Article
%A A. Adrabiński
%A J. Grabowski
%A M. Wodecki
%T An algorithm for solving a certain sequencing problem
%J Mathematica Applicanda
%D 1982
%P  59-85
%V 10
%N 18
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.14708/ma.v10i18.1523/
%R 10.14708/ma.v10i18.1523
%G pl
%F 10_14708_ma_v10i18_1523
A. Adrabiński; J. Grabowski; M. Wodecki. An algorithm for solving a certain sequencing problem. Mathematica Applicanda, Tome 10 (1982) no. 18, pp.  59-85. doi : 10.14708/ma.v10i18.1523. http://geodesic.mathdoc.fr/articles/10.14708/ma.v10i18.1523/

Cité par Sources :