A dynamic programming based algorithm for the crew scheduling problem.

DOI10.1016/S0305-0548(98)00019-7zbMath1040.90524OpenAlexW2024026601MaRDI QIDQ1406659

D. Massart

Publication date: 7 September 2003

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(98)00019-7

zbMATH Keywords

dynamic programmingCrew scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items

Human resources management at a marine container terminal ⋮ Crew Assignment with Duty Time Limits for Transport Services: Tight Multicommodity Models ⋮ Staff scheduling and rostering: a review of applications, methods and models. ⋮ Optimizing schedules of rail train circulations by tabu search algorithm ⋮ A model for bus crew scheduling problem with multiple duty types ⋮ An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP ⋮ The Multicommodity Multilevel Bottleneck Assignment Problem

Uses Software

• OR-Library
• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Network models for vehicle and crew scheduling
• A heuristic approach to the bus driver scheduling problem
• A new approach for crew pairing problems by column generation with an application to air transportation
• The travelling salesman problem as a constrained shortest path problem: Theory and computational experience
• A tree search algorithm for the crew scheduling problem
• Solving large scale crew scheduling problems
• State space relaxation for set covering problems related to bus driver scheduling
• The design of a 0-1 integer optimizer and its application in the Carmen system
• An algorithm for large scale 0-1 integer programming with application to airline crew scheduling
• Application of a hybrid genetic algorithm to airline crew scheduling
• A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm
• Constraint handling in genetic algorithms: the set partitioning 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
• An Optimal Solution for the Channel-Assignment Problem
• State-space relaxation procedures for the computation of bounds to routing problems
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• A Multiplier Adjustment Approach for the Set Partitioning Problem
• Minimal Resources for Fixed and Variable Job Schedules
• Solving Airline Crew Scheduling Problems by Branch-and-Cut
• Flight Crew Scheduling
• The Column Generation Principle And The Airline Crew Scheduling Problem