Crew Assignment with Duty Time Limits for Transport Services: Tight Multicommodity Models
From MaRDI portal
Publication:5080634
DOI10.1287/opre.2021.2155zbMath1490.90036OpenAlexW4200322619MaRDI QIDQ5080634
Prakash Mirchandani, Anantaram Balakrishnan, Sifeng Lin
Publication date: 31 May 2022
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.2021.2155
Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Unnamed Item
- Unnamed Item
- Rich vehicle routing problems: from a taxonomy to a definition
- Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem
- A tree search algorithm for the crew scheduling problem
- A dynamic programming based algorithm for the crew scheduling problem.
- Staff scheduling and rostering: a review of applications, methods and models.
- An annotated bibliography of personnel scheduling and rostering
- An exact algorithm for the simplified multiple depot crew scheduling problem
- Conflict graphs in solving integer programming problems
- Vehicle and crew scheduling for urban bus lines
- Modeling and Solving the Crew Rostering Problem
- Vehicle Scheduling in Public Transit and Lagrangean Pricing
- A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems
- A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem
- The Fixed Job Schedule Problem with Spread-Time Constraints
- A Column Generation Approach to the Urban Transit Crew Scheduling Problem
- The Fixed Job Schedule Problem with Working-Time Constraints
- A Set Partitioning Approach to the Crew Scheduling Problem
- Optimal Network Design with End-to-End Service Requirements
- A Multicommodity Flow Approach to the Crew Rostering Problem
This page was built for publication: Crew Assignment with Duty Time Limits for Transport Services: Tight Multicommodity Models
