A dynamic programming based algorithm for the crew scheduling problem.
From MaRDI portal
Recommendations
Cites work
- A Column Generation Approach to the Urban Transit Crew Scheduling Problem
- A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm
- A heuristic approach to the bus driver scheduling problem
- A Multiplier Adjustment Approach for the Set Partitioning Problem
- A new approach for crew pairing problems by column generation with an application to air transportation
- A tree search algorithm for the crew scheduling problem
- An algorithm for large scale 0-1 integer programming with application to airline crew scheduling
- An Optimal Solution for the Channel-Assignment Problem
- Application of a hybrid genetic algorithm to airline crew scheduling
- Constraint handling in genetic algorithms: the set partitioning problem
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- Flight Crew Scheduling
- scientific article; zbMATH DE number 4162637 (Why is no real title available?)
- scientific article; zbMATH DE number 3744893 (Why is no real title available?)
- scientific article; zbMATH DE number 3503127 (Why is no real title available?)
- Minimal Resources for Fixed and Variable Job Schedules
- Network models for vehicle and crew scheduling
- Solving Airline Crew Scheduling Problems by Branch-and-Cut
- Solving large scale crew scheduling problems
- State space relaxation for set covering problems related to bus driver scheduling
- State-space relaxation procedures for the computation of bounds to routing problems
- The Column Generation Principle And The Airline Crew Scheduling Problem
- The design of a 0-1 integer optimizer and its application in the Carmen system
- The Fixed Job Schedule Problem with Spread-Time Constraints
- The Fixed Job Schedule Problem with Working-Time Constraints
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- The travelling salesman problem as a constrained shortest path problem: Theory and computational experience
Cited in
(10)- A tree search algorithm for the crew scheduling problem
- Staff scheduling and rostering: a review of applications, methods and models.
- Human resources management at a marine container terminal
- An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP
- The Multicommodity Multilevel Bottleneck Assignment Problem
- scientific article; zbMATH DE number 4162637 (Why is no real title available?)
- scientific article; zbMATH DE number 1070503 (Why is no real title available?)
- Optimizing schedules of rail train circulations by tabu search algorithm
- Crew Assignment with Duty Time Limits for Transport Services: Tight Multicommodity Models
- A model for bus crew scheduling problem with multiple duty types
This page was built for publication: A dynamic programming based algorithm for the crew scheduling problem.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1406659)