Previous |  Up |  Next


bus scheduling; crew scheduling; journey; graph; independent set; expanding graph; contracting graph
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.
[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 10.1002/net.3230190505 | MR 1006191
[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 1739917
[7] K. Vašek: Optimal vehicle scheduling decomposition problem. Zb. prác VÚD Žilina 45 (1985), 148–154. (Slovak)
Partner of
EuDML logo