Modeling and Solving the Crew Rostering Problem
From MaRDI portal
Publication:2781158
DOI10.1287/opre.46.6.820zbMath0987.90035OpenAlexW2166491841MaRDI QIDQ2781158
Matteo Fischetti, Alberto Caprara, Paolo Toth, Daniele Vigo
Publication date: 1 July 2002
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/13b9786c4e46048e3fe9877508ec2c91e4f915d3
Deterministic scheduling theory in operations research (90B35) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70)
Related Items
Human resources management at a marine container terminal, Rostering in a rail passenger carrier, Multi-objective integrated acyclic crew rostering and vehicle assignment problem in public bus transportation, Generating, scheduling and rostering of shift crew-duties: applications at the Hong Kong international airport, Algorithms for railway crew management, An efficient solution approach for real-world driver scheduling problems in urban bus transportation, Crew Assignment with Duty Time Limits for Transport Services: Tight Multicommodity Models, Optimizing railway crew schedules with fairness preferences, A new model for the integrated vehicle-crew-rostering problem and a computational study on rosters, On assigning drivers for a home-delivery system on a performance basis, Metaheuristics approach to the aircrew rostering problem, The relationship between attribute reducts in rough sets and minimal vertex covers of graphs, A survey on robustness in railway planning, Enhanced genetic algorithms for a bi‐objective bus driver rostering problem: a computational study, A goal programming model for crew duties generation, A hybrid scatter search heuristic for personalized crew rostering in the airline industry, Experimental analysis of approximation algorithms for the vertex cover and set covering problems, Two-level decomposition algorithm for crew rostering problems with fair working condition, Vehicle and crew scheduling for urban bus lines, A set covering approach for multi-depot train driver scheduling, The Multicommodity Multilevel Bottleneck Assignment Problem
