A note to independent sets in scheduling

Jan Černý

Applications of Mathematics (1995)

  • Volume: 40, Issue: 5, page 357-365
  • ISSN: 0862-7940

Abstract

top
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.

How to cite

top

Černý, Jan. "A note to independent sets in scheduling." Applications of Mathematics 40.5 (1995): 357-365. <http://eudml.org/doc/32924>.

@article{Černý1995,
abstract = {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.},
author = {Černý, Jan},
journal = {Applications of Mathematics},
keywords = {bus scheduling; crew scheduling; journey; graph; independent set; expanding graph; contracting graph; crew scheduling; expanding graph; contracting graph; bus-journey graphs; total service time of crews},
language = {eng},
number = {5},
pages = {357-365},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {A note to independent sets in scheduling},
url = {http://eudml.org/doc/32924},
volume = {40},
year = {1995},
}

TY - JOUR
AU - Černý, Jan
TI - A note to independent sets in scheduling
JO - Applications of Mathematics
PY - 1995
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 40
IS - 5
SP - 357
EP - 365
AB - 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.
LA - eng
KW - bus scheduling; crew scheduling; journey; graph; independent set; expanding graph; contracting graph; crew scheduling; expanding graph; contracting graph; bus-journey graphs; total service time of crews
UR - http://eudml.org/doc/32924
ER -

References

top
  1. 10.1002/net.3230190505, Networks 19 (1989), 531–548. (1989) MR1006191DOI10.1002/net.3230190505
  2. Optimum scheduling in transportation, Zbornik VŠD v Žiline 6 (1967), 215–222. (Slovak, English summary) (1967) 
  3. Scheduling in transportation systems, Research Report VÚD Žilina III/8/6–09.6 (1985). (Slovak) (1985) 
  4. Application of the man machine system in bus and crew scheduling in personal transport, Ph.D. thesis, U. of Žilina, 1987. (Slovak) (1987) 
  5. Transport scheduling and its optimization, Research Report VÚD Žilina (1990). (Slovak) (1990) 
  6. Optimal bus scheduling using independent sets in transitive graphs, Preprint, FR VŠDS Žilina, 1992. (1992) MR1739917
  7. Optimal vehicle scheduling decomposition problem, Zb. prác VÚD Žilina 45 (1985), 148–154. (Slovak) (1985) 

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.