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

DOI MR   Zbl

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.
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 
Č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
@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},
     year = {1995},
     volume = {40},
     number = {5},
     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
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
%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

[1] G. Carpaneto, M. Dell’Amico, P. Toth: A branch and bound algorithm for the multiple depot scheduling problem. Networks 19 (1989), 531–548. | DOI | MR

[2] J. Černý: Optimum scheduling in transportation. Zbornik VŠD v Žiline 6 (1967), 215–222. (Slovak, English summary)

[3] J. Černý, D. Engelthaller, S. Palúch, Š. Peško, K. Vašek, A. Černá: Scheduling in transportation systems. Research Report VÚD Žilina III/8/6–09.6 (1985). (Slovak)

[4] D. Engelhaller: Application of the man machine system in bus and crew scheduling in personal transport. Ph.D. thesis, U. of Žilina, 1987. (Slovak)

[5] J. Černý, D. Engelthaller, S. Palúch, Š. Peško, K. Vašek, A. Černá: Transport scheduling and its optimization. Research Report VÚD Žilina (1990). (Slovak)

[6] S. Palúch: Optimal bus scheduling using independent sets in transitive graphs. Preprint, FR VŠDS Žilina, 1992. | MR

[7] K. Vašek: Optimal vehicle scheduling decomposition problem. Zb. prác VÚD Žilina 45 (1985), 148–154. (Slovak)

Cité par Sources :