A graph partitioning strategy for solving large-scale crew scheduling problems
From MaRDI portal
Publication:2260895
DOI10.1007/s00291-014-0381-8zbMath1308.90018OpenAlexW2058453375MaRDI QIDQ2260895
Silke Jütte, Ulrich Wilhelm Thonemann
Publication date: 12 March 2015
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-014-0381-8
Transportation, logistics and supply chain management (90B06) Stochastic scheduling theory in operations research (90B36) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph designs and isomorphic decomposition (05C51)
Related Items (3)
A matheuristic for tactical locomotive and driver scheduling for the swiss national railway company SBB Cargo AG ⋮ An efficient column generation approach for practical railway crew scheduling with attendance rates ⋮ Railway crew scheduling: models, methods and applications
Cites Work
- Unnamed Item
- Unnamed Item
- Divide-and-price: a decomposition algorithm for solving large railway crew scheduling problems
- Dual variable based fathoming in dynamic programs for column generation
- Airline crew scheduling: state-of-the-art
- Branching strategies to improve regularity of crew schedules in ex-urban public transit
- Some simplified NP-complete graph problems
- Staff scheduling and rostering: a review of applications, methods and models.
- Personnel scheduling: a literature review
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- A Survey of Optimization Models for Train Routing and Scheduling
- An Efficient Heuristic Procedure for Partitioning Graphs
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- How Good is Recursive Bisection?
- Simultaneous Vehicle and Crew Scheduling in Urban Mass Transit Systems
- On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
- A Column Generation Approach for Large-Scale Aircrew Rostering Problems
- A Heuristic Method for the Set Covering Problem
- Selected Topics in Column Generation
- A Primer in Column Generation
- Shortest Path Problems with Resource Constraints
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
This page was built for publication: A graph partitioning strategy for solving large-scale crew scheduling problems
