Figure 4 - available via license: Creative Commons Attribution 4.0 International
Content may be subject to copyright.
Download
View publication
Residual graph í µí± corresponding to the infeasible solution from Figure 3. Each directed edge represents the residual capacity between two nodes, if positive.

Residual graph í µí± corresponding to the infeasible solution from Figure 3. Each directed edge represents the residual capacity between two nodes, if positive.

Source publication
Figure 1: Assignment of MOs to shifts. This figure presents four MOs...
Figure 2: Graphical representation of the MSLCP, demonstrating how it...
Figure 3: Flow graph í µí°º corresponding to the RAPP model. Edges í...
Figure 4: Residual graph í µí± corresponding to the infeasible solution...
+5 Figure 5: Reachable Components graph í µí°» , separating the various...
The Maintenance Scheduling and Location Choice Problem for Railway Rolling Stock
Preprint
Full-text available
  • Feb 2021
Due to increasing railway use, the capacity at railway yards and maintenance locations is becoming limiting. Therefore, the scheduling of rolling stock maintenance and the choice regarding optimal locations to perform maintenance is increasingly complicated. This research introduces a Maintenance Scheduling and Location Choice Problem (MSLCP). It s...
Cite
Download full-text