h1

% IMPORTANT: The following is UTF-8 encoded.  This means that in the presence
% of non-ASCII characters, it will not work with BibTeX 0.99 or older.
% Instead, you should use an up-to-date BibTeX implementation like “bibtex8” or
% “biber”.

@PHDTHESIS{Herbers:59558,
      author       = {Herbers, Jörg},
      othercontributors = {Hromkovic, Juraj},
      title        = {{M}odels and algorithms for ground staff scheduling on
                      airports},
      address      = {Aachen},
      publisher    = {Publikationsserver der RWTH Aachen University},
      reportid     = {RWTH-CONV-121335},
      pages        = {XVI, 259 S. : graph. Darst.},
      year         = {2005},
      note         = {Aachen, Techn. Hochsch., Diss., 2005},
      abstract     = {The planning of airport ground staff gives rise to a number
                      of challenging optimisation problems. Ground handling
                      workloads are naturally represented as work tasks, e.g. for
                      baggage unloading or passenger check-in. These workloads
                      must be covered by appropriate employees. Staff scheduling
                      is usually carried out in several stages: In demand
                      planning, workloads are aggregated and analysed, in shift
                      planning, appropriate shift duties are generated, and
                      rostering consists in generating lines of duty for the
                      workers. These phases are strongly interrelated, and
                      different optimisation problems have to be solved at each
                      stage. Workforce scheduling models have traditionally built
                      upon aggregate labour requirements given in discrete time
                      periods. However, the literature does not describe any
                      models or algorithms for the generation of appropriate
                      workload representations. Additionally, it will not always
                      be sufficient to cover coarse-grained abstractions of
                      workloads. If information on flights as well as passenger
                      and load figures are sufficiently exact, we will rather be
                      interested in directly covering individual work tasks.
                      Furthermore, shift scheduling and rostering approaches have
                      regularly taken special assumptions or investigated
                      simplified problems, limiting their practical applicability.
                      In this work, we tackle optimisation problems at different
                      planning stages. We show how in the presence of movable
                      tasks, we can obtain a suitable demand curve representation
                      of workloads, using a levelling procedure which combines
                      aspects from vehicle routing and resource levelling.
                      Furthermore, we devise two algorithms for task-level shift
                      planning which relates to vehicle routing and shift
                      scheduling models. The first method is an improvement
                      procedure, building upon the results of a construction phase
                      and dealing with a complex shift planning setting. The
                      second algorithm focuses on a subclass of task-level shift
                      planning and is able to solve many problems to proven
                      optimality. Finally, we design an algorithm for complex
                      cyclic rostering on the basis of aggregate workloads. The
                      approach builds upon a novel model for representing flexible
                      breaks and solves the shift scheduling and rostering stage
                      simultaneously. Models and algorithms proposed in this
                      thesis are more integrated and tackle more complex settings
                      than previous approaches. We employ modern constraint
                      programming and integer programming solution techniques,
                      including column generation and branch-and-price. For the
                      novel optimisation problems treated in this work, we provide
                      complexity results. All algorithms are evaluated on complex
                      large-scale test cases from the practice of airlines,
                      airports and ground handling companies.},
      keywords     = {Flughafen (SWD) / Bodenpersonal (SWD) / Personalplanung
                      (SWD) / Ganzzahlige Optimierung (SWD) /
                      Constraint-Programmierung (SWD)},
      cin          = {100000},
      ddc          = {380},
      cid          = {$I:(DE-82)100000_20140620$},
      typ          = {PUB:(DE-HGF)11},
      urn          = {urn:nbn:de:hbz:82-20050708},
      url          = {https://publications.rwth-aachen.de/record/59558},
}