A multi-level bottleneck assignment approach to the bus drivers' rostering problem

DOI10.1016/0377-2217(84)90071-7zbMath0537.90076OpenAlexW2011647332MaRDI QIDQ792882

Paolo Carraresi, Giorgio Gallo

Publication date: 1984

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(84)90071-7

zbMATH Keywords

computational resultsasymptotically optimal algorithmNP- completeMulti-level Bottleneck Assignmentwork assignment for drivers

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Boolean programming (90C09)

Related Items (21)

Human resources management at a marine container terminal ⋮ Multi-objective integrated acyclic crew rostering and vehicle assignment problem in public bus transportation ⋮ A decompose-and-fix heuristic based on multi-commodity flow models for driver rostering with days-off pattern ⋮ Assignment problems: a golden anniversary survey ⋮ Modelling and planning public cultural schedules for efficient use of resources ⋮ On the complexity of manpower shift scheduling ⋮ Algorithms for railway crew management ⋮ The dominance assignment problem ⋮ Sensitivity analysis for bottleneck assignment problems ⋮ Multi-level bottleneck assignment problems: complexity and sparsity-exploiting formulations ⋮ Approximating the multi-level bottleneck assignment problem ⋮ A new model for the integrated vehicle-crew-rostering problem and a computational study on rosters ⋮ A heuristic procedure for the crew rostering problem ⋮ Random assignment problems ⋮ Enhanced genetic algorithms for a bi‐objective bus driver rostering problem: a computational study ⋮ Cyclic and non-cyclic crew rostering problems in public bus transit ⋮ Balanced paths in acyclic networks: Tractable cases and related approaches ⋮ Network models for vehicle and crew scheduling ⋮ The Multicommodity Multilevel Bottleneck Assignment Problem ⋮ The Curricular Practical Training Rotation Problem Formulation and the Assessment of Rotation Strategies ⋮ A MIP model for scheduling India's general elections and police movement

Cites Work

• An augmenting path method for solving linear bottleneck assignment problems
• Unnamed Item
• Unnamed Item

This page was built for publication: A multi-level bottleneck assignment approach to the bus drivers' rostering problem