An exact algorithm for the simplified multiple depot crew scheduling problem
From MaRDI portal
Publication:1888181
DOI10.1023/B:ANOR.0000019089.86834.91zbMath1087.90027OpenAlexW2007125830MaRDI QIDQ1888181
Aristide Mingozzi, Marco Antonio Boschetti, Salvatore Ricciardelli
Publication date: 22 November 2004
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:anor.0000019089.86834.91
Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Crew Assignment with Duty Time Limits for Transport Services: Tight Multicommodity Models ⋮ A General Branch-and-Cut Framework for Rotating Workforce Scheduling ⋮ Matheuristics: survey and synthesis ⋮ A matheuristic for tactical locomotive and driver scheduling for the swiss national railway company SBB Cargo AG ⋮ A dual ascent procedure for the set partitioning problem ⋮ The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem ⋮ An exact solution framework for a broad class of vehicle routing problems ⋮ Railway crew scheduling: models, methods and applications ⋮ A set covering based matheuristic for a real‐world city logistics problem
This page was built for publication: An exact algorithm for the simplified multiple depot crew scheduling problem
