Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Sebastian Meiswinkel"'
Publikováno v:
European Journal of Operational Research. 279:732-750
We address an optimization problem that arises at seaports where containers are transported between stacking areas and small buffer areas of restricted capacity that are located within the reach of quay cranes. The containers are transported by strad
Publikováno v:
Discrete Applied Mathematics. 242:89-101
We consider the problem of designing polynomial time truthful mechanisms for machine scheduling problems with parallel identical machines where some of the jobs’ characteristics are private information of their respective owners and a central decis
Publikováno v:
OR Spectrum. 40:583-611
This paper provides a literature overview on (direct revelation) algorithmic mechanism design in the context of machine scheduling problems. Here, one takes a game-theoretic perspective and assumes that part of the relevant data of the machine schedu
There is a finite number of non-cooperating clients, who are averse to uncertain loss and compete for execution of their jobs not later than by their respective due dates in a parallel service environment. For each client, a due date violation implie
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1418637ca34aab7589d7c0af0713871e
https://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&origin=inward&scp=85056450006
https://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&origin=inward&scp=85056450006
Autor:
Sebastian Meiswinkel
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 owne
Publikováno v:
European Journal of Operational Research. 247:745-754
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 bipartit
Publikováno v:
European Cities in Dynamic Competition ISBN: 9783662564189
Globalization and digitalization have lead to new challenges and perspectives in intermodal transport logistics of large city sea ports and megahubs. In particular, due to an enormous increase of the container throughput over the last decades and the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b21e36e6adf33fa563630bc6648ea4bd
https://doi.org/10.1007/978-3-662-56419-6_11
https://doi.org/10.1007/978-3-662-56419-6_11
Autor:
Sebastian Meiswinkel
Publikováno v:
On Combinatorial Optimization and Mechanism Design Problems Arising at Container Ports ISBN: 9783658223618
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::547758390b21d9272bc9e5d0391aba0f
https://doi.org/10.1007/978-3-658-22362-5_4
https://doi.org/10.1007/978-3-658-22362-5_4
Autor:
Sebastian Meiswinkel
Publikováno v:
On Combinatorial Optimization and Mechanism Design Problems Arising at Container Ports ISBN: 9783658223618
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8e1298d57502e8cb3995fef5e014af15
https://doi.org/10.1007/978-3-658-22362-5_5
https://doi.org/10.1007/978-3-658-22362-5_5
Autor:
Sebastian Meiswinkel
Publikováno v:
On Combinatorial Optimization and Mechanism Design Problems Arising at Container Ports ISBN: 9783658223618
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 algorith
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4af673364dfc019d4f55b43f52cd0750
https://doi.org/10.1007/978-3-658-22362-5_2
https://doi.org/10.1007/978-3-658-22362-5_2