Pages that link to "Item:Q792882"
From MaRDI portal
The following pages link to A multi-level bottleneck assignment approach to the bus drivers' rostering problem (Q792882):
Displayed 21 items.
- A MIP model for scheduling India's general elections and police movement (Q260654) (← links)
- A decompose-and-fix heuristic based on multi-commodity flow models for driver rostering with days-off pattern (Q319599) (← links)
- Modelling and planning public cultural schedules for efficient use of resources (Q337501) (← links)
- Approximating the multi-level bottleneck assignment problem (Q453052) (← links)
- A new model for the integrated vehicle-crew-rostering problem and a computational study on rosters (Q657257) (← links)
- Network models for vehicle and crew scheduling (Q792872) (← links)
- Assignment problems: a golden anniversary survey (Q852938) (← links)
- Random assignment problems (Q953417) (← links)
- A heuristic procedure for the crew rostering problem (Q1194743) (← links)
- Algorithms for railway crew management (Q1365052) (← links)
- Multi-objective integrated acyclic crew rostering and vehicle assignment problem in public bus transportation (Q1642066) (← links)
- Human resources management at a marine container terminal (Q1877919) (← links)
- On the complexity of manpower shift scheduling (Q1906950) (← links)
- The dominance assignment problem (Q1926493) (← links)
- Cyclic and non-cyclic crew rostering problems in public bus transit (Q2260894) (← links)
- Sensitivity analysis for bottleneck assignment problems (Q2673565) (← links)
- The Multicommodity Multilevel Bottleneck Assignment Problem (Q3439124) (← links)
- Balanced paths in acyclic networks: Tractable cases and related approaches (Q4667719) (← links)
- The Curricular Practical Training Rotation Problem Formulation and the Assessment of Rotation Strategies (Q5026167) (← links)
- Enhanced genetic algorithms for a bi‐objective bus driver rostering problem: a computational study (Q5416757) (← links)
- Multi-level bottleneck assignment problems: complexity and sparsity-exploiting formulations (Q6164589) (← links)