Skip to main content
main-content

Über dieses Buch

Sebastian Meiswinkel studies optimization problems that arise at container ports from a classic optimization as well as from a mechanism design point of view. The first part of this dissertation is focused on scheduling problems with selfish job owners that have private information about their characteristics. Afterwards the transportations of containers between the quay and a storage area is considered. Variants of this problem are analyzed for utilization of reach stackers and straddle carriers.

Inhaltsverzeichnis

Frontmatter

Chapter 1. Introduction and Preliminaries

Container ports are important parts of global transport chains. They are used to transship containers between vessels and vehicles for land transport. Large container ports often operate own rail-road terminals in order to connect the port with the hinterland efficiently.
Sebastian Meiswinkel

Chapter 2. Mechanism Design and Machine Scheduling: Literature Review

There exists a tremendous body of literature that focuses on intersections of (algorithmic aspects of) computer science and game theory (as well as economic theory). The resulting fields of intersecting disciplines are usually referred to as algorithmic game theory (an excellent introduction and overview is given by Nisan et al., 2007). Many research articles in this field focus on auction contexts (see Krishna, 2010).
Sebastian Meiswinkel

Chapter 3. Truthful Algorithms for Job Agents

In this chapter we will consider scheduling problems with parallel (identical) machines and publicly known processing times as in Kress et al. (2018a) and Kress et al. (2017). These problems will be considered in the context of algorithmic mechanism design, with the job-owners being strategic players or agents.
Sebastian Meiswinkel

Chapter 4. The Partitioning Min-Max Weighted Matching Problem

In this chapter we consider a variant of the strongly NP-hard Min-Max Weighted Matching (MMWM) Problem, that has recently been introduced by Barketau et al. (2015) as in Kress et al. (2015). An instance of MMWM is defined by an edge-weighted bipartite graph G(U; V;E) with disjoint vertex sets U and V (bipartitions), edge set E, and a partitioning of U into disjoint subsets (components). Given a maximum matching on G, the weight of a component is defined as the sum of the weights of the edges of the matching that are incident to the vertices of the component.
Sebastian Meiswinkel

Chapter 5. Straddle Carrier Routing at Container Ports with Quay Crane Buffers

Nearly all ports have at least roughly the same work flow. To achieve a good berth utilization in larger ports that can serve several vessels simultaneously, an appropriate berth assignment of arriving vessels is indispensable. Each berth is equipped with at least one quay crane, but can also have five quay cranes or more.
Sebastian Meiswinkel

Chapter 6. Summary and Outlook

In context of container ports, various optimization problems arise. There are optimization problems that depend only on internal information that is available to a decision maker as well as optimization problems that depend on information of customers of the port. The latter case makes it necessary to use methods from the field of mechanism design in order to extract true and therefore useful information from the customers.
Sebastian Meiswinkel

Backmatter

Weitere Informationen

Premium Partner

BranchenIndex Online

Die B2B-Firmensuche für Industrie und Wirtschaft: Kostenfrei in Firmenprofilen nach Lieferanten, Herstellern, Dienstleistern und Händlern recherchieren.

Whitepaper

- ANZEIGE -

Voraussetzungen für die wirtschaftliche additive Fertigung

Viele Unternehmen stellen die technische Umsetzbarkeit oder die Wirtschaftlichkeit additiv gefertigter Produkte in Frage und zögern bei der Anwendung. Mit einer neuen Denkweise führt die additive Fertigung jedoch zu höherer Wirtschaftlichkeit und Vorteilen im Wettbewerb, wie Kegelmann Technik in diesem Beitrag beschreibt.
Jetzt gratis downloaden!

Bildnachweise