zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Airline crew rostering: problem types, modeling, and optimization. (English) Zbl 1087.90031
Summary: Airline crew rostering is an important part of airline operations and an interesting problem for the application of operations research. The objective is to assign anonymous crew pairings either to personalized rosters or to anonymous bidlines which subsequently will be assigned to individual crew members. Compared to the crew pairing problem, crew rostering has received much less attention in the academic literature and the models presented have been rather simplified. The contribution of this paper is two-fold. First, we want to give a more comprehensive description of real-world airline crew rostering problems and the mathematical models used to capture the various constraints and objectives found in the airline industry. As this has not been attempted in previous research, we think it serves a purpose to reveal the complexity of real-world crew rostering to readers without industrial knowledge of the problem. Second, we want to present the solution methods employed in a commercial crew rostering system, in whose development we both have been involved. The Carmen Crew Rostering system is currently in use at several major European airlines including British Airways, KLM, Iberia, Alitalia, and Scandinavian Airlines (SAS) as well as at one of the world’s largest passenger transportation company Deutsche Bahn (German State Railways). During the development of the Carmen Crew Rostering system, we have gained valuable experience about practical problem solving and we think the system constitutes an interesting case in the application of operations research.

90B35Scheduling theory, deterministic
90C90Applications of mathematical programming
90B06Transportation, logistics
Full Text: DOI