Geodesic
A note to independent sets in scheduling
Applications of Mathematics, Tome 40 (1995) no. 5, pp. 357-365

Voir la notice de l'article provenant de la source Czech Digital Mathematics Library

The paper studies the bus-journey graphs in the case when they are piecewise expanding and contracting (if described by fathers-sons relations starting with the greatest independent set of nodes). This approach can make it possible to solve the minimization problem of the total service time of crews.
DOI : 10.21136/AM.1995.134299
Classification : 05C35, 90B35
Keywords: bus scheduling; crew scheduling; journey; graph; independent set; expanding graph; contracting graph 
@article{10_21136_AM_1995_134299,
     author = {\v{C}ern\'y, Jan},
     title = {A note to independent sets in scheduling},
     journal = {Applications of Mathematics},
     pages = {357--365},
     publisher = {mathdoc},
     volume = {40},
     number = {5},
     year = {1995},
     doi = {10.21136/AM.1995.134299},
     mrnumber = {1342365},
     zbl = {0840.90090},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/AM.1995.134299/}
}
TY  - JOUR
AU  - Černý, Jan
TI  - A note to independent sets in scheduling
JO  - Applications of Mathematics
PY  - 1995
SP  - 357
EP  - 365
VL  - 40
IS  - 5
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.21136/AM.1995.134299/
DO  - 10.21136/AM.1995.134299
LA  - en
ID  - 10_21136_AM_1995_134299
ER  - 
%0 Journal Article
%A Černý, Jan
%T A note to independent sets in scheduling
%J Applications of Mathematics
%D 1995
%P 357-365
%V 40
%N 5
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.21136/AM.1995.134299/
%R 10.21136/AM.1995.134299
%G en
%F 10_21136_AM_1995_134299
Černý, Jan. A note to independent sets in scheduling. Applications of Mathematics, Tome 40 (1995) no. 5, pp. 357-365. doi: 10.21136/AM.1995.134299

Cité par Sources :