A tree search algorithm for the crew scheduling problem

DOI10.1016/0377-2217(95)00093-3zbMath0947.90577MaRDI QIDQ1278340

K. Appert

Publication date: 8 November 2000

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

Full work available at URL: https://doi.org/10.1016/0377-2217(95)00093-3

zbMATH Keywords

Lagrangean relaxation; crew scheduling; optimisation

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C08: Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)

Related Items

\textsc{Laps}\ \textsc{Care} -- an operational system for staff planning of home care, Computing the metric dimension of graphs by genetic algorithms, Computing minimal doubly resolving sets of graphs, A tree search algorithm for the crew scheduling problem, A dynamic programming based algorithm for the crew scheduling problem.

Uses Software

• OR-Library

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
• A tree search algorithm for the crew scheduling problem
• Lagrangean heuristics for location problems
• A Column Generation Approach to the Urban Transit Crew Scheduling Problem
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Solving Airline Crew Scheduling Problems by Branch-and-Cut
• Flight Crew Scheduling
• The Column Generation Principle And The Airline Crew Scheduling Problem