On the public citation graph
Robust Tactical Crew Scheduling Under Uncertain Demand
0 signed · 30 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-642-05465-5_1openalex-snapshot
The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
inferredcites →https://doi.org/10.1007/s10845-007-0017-9openalex-snapshot
Personnel scheduling in a complex logistic system: a railway application case
inferredcites →https://doi.org/10.1007/s10878-009-9247-4openalex-snapshot
Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases
inferredcites →https://doi.org/10.1007/s12469-010-0033-6openalex-snapshot
Real-time train driver rescheduling by actor-agent techniques
inferredcites →https://doi.org/10.1007/s12469-017-0155-1openalex-snapshot
A heuristic for real-time crew rescheduling during small disruptions
inferredcites →https://doi.org/10.1016/j.disopt.2006.05.007openalex-snapshot
Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
inferredcites →https://doi.org/10.1016/j.ejor.2006.04.026openalex-snapshot
A column generation approach for the rail crew re-scheduling problem
inferredcites →https://doi.org/10.1016/j.ejor.2011.12.038openalex-snapshot
Divide-and-price: A decomposition algorithm for solving large railway crew scheduling problems
inferredcites →https://doi.org/10.1016/j.ejor.2017.07.044openalex-snapshot
A survey on robustness in railway planning
inferredcites →https://doi.org/10.1016/j.ejor.2019.06.016openalex-snapshot
Railway crew scheduling: Models, methods and applications
inferredcites →https://doi.org/10.1080/03155986.1988.11732063openalex-snapshot
A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
inferredcites →https://doi.org/10.1287/trsc.1100.0322openalex-snapshot
Column Generation with Dynamic Duty Selection for Railway Crew Rescheduling
inferredcites →https://doi.org/10.1287/trsc.1110.0388openalex-snapshot
Railway Rolling Stock Planning: Robustness Against Large Disruptions
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s12063-024-00469-1openalex-snapshot
Scheduling in services: a review and bibliometric analysis
inferred← citeshttps://doi.org/10.1007/s40864-026-00272-0openalex-snapshot
Railway Crew Rostering: Tailored Optimization Solutions in Daily Use in Berlin
inferred← citeshttps://doi.org/10.1016/j.asoc.2025.113574openalex-snapshot
A hybrid genetic tabu search algorithm for metro crew scheduling based on a space-time-state network
inferred← citeshttps://doi.org/10.1016/j.cie.2025.111168openalex-snapshot
An integrated modeling approach for multi-class individual crew scheduling in demand channels
inferred← citeshttps://doi.org/10.1016/j.ejor.2024.04.029openalex-snapshot
Railway crew planning with fairness over time
inferred← citeshttps://doi.org/10.1016/j.ejor.2025.05.004openalex-snapshot
Robust optimization of a procurement and routing strategy for multiperiod multimodal transport in an uncertain environment
inferred← citeshttps://doi.org/10.1016/j.ins.2024.121112openalex-snapshot
Intelligent decision modeling for optimizing railway cold chain service networks under uncertainty
inferred← citeshttps://doi.org/10.1016/j.jrtpm.2024.100487openalex-snapshot
A decomposition approach to solve the individual railway crew Re-planning problem
inferred← citeshttps://doi.org/10.1016/j.jrtpm.2025.100519openalex-snapshot
Weekly crew scheduling for freight rail engineers: A network approach
inferred← citeshttps://doi.org/10.1016/j.trb.2024.102942openalex-snapshot
Weekly scheduling for freight rail engineers & trainmen
inferred← citeshttps://doi.org/10.1016/j.trc.2025.105304openalex-snapshot
A two-stage reservation and allocation approach for smart parking system considering parking unpunctuality
inferred← citeshttps://doi.org/10.1287/trsc.2022.1196openalex-snapshot
Using Machine Learning to Include Planners’ Preferences in Railway Crew Scheduling Optimization
inferred← citeshttps://doi.org/10.1287/trsc.2024.0905openalex-snapshot
Joint Rolling Stock and Crew Scheduling with Multi-train Composition in Urban Rail Networks
inferred← citeshttps://doi.org/10.1287/trsc.2024.1013openalex-snapshot
Benders Decomposition for Robust Tactical Railway Crew Scheduling
inferred← citeshttps://doi.org/10.47072/demiryolu.1842458openalex-snapshot
Mürettebat Görev Planlama Problemi için Gezgin Satıcı Problemi Tabanlı Bir Matematiksel Model: Bir Demiryolu Lojistik Merkezinde Uygulama
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.