Zobrazeno 1 - 10
of 28
pro vyhledávání: '"König, Felix G."'
Publikováno v:
Transportation Science, 2016 May 01. 50(2), 439-460.
Externí odkaz:
http://www.jstor.org/stable/43903276
Publikováno v:
Transportation Science, 2013 Feb 01. 47(1), 3-22.
Externí odkaz:
https://www.jstor.org/stable/23362883
Publikováno v:
Management Science, 2011 Apr 01. 57(4), 647-666.
Externí odkaz:
http://dx.doi.org/10.1287/mnsc.1100.1302
Autor:
König, Felix G.
Techn. Univ., Diss., 2009--Berlin.
Externí odkaz:
http://d-nb.info/1000799832/34
http://nbn-resolving.de/urn:nbn:de:kobv:83-opus-25284
http://opus.kobv.de/tuberlin/volltexte/2010/2528/
http://nbn-resolving.de/urn:nbn:de:kobv:83-opus-25284
http://opus.kobv.de/tuberlin/volltexte/2010/2528/
In this paper, we study a multi-dimensional commodity covering problem, which we encountered as a subproblem in optimizing large scale transportation networks in logistics. The problem asks for a selection of containers for transporting a given set o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fdc45fb388e5921f3b12a64e4745999c
Autor:
König, Felix G.
Nach einem einführenden Überblickskapitel gliedert sich die Dissertation in zwei Teile. Der erste Teil beschäftigt sich mit dem Sortieren durch Netzwerke von Stapeln. Zunächst wird eine motivierende Anwendung aus der integrierten Stahlproduktion
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______793::0595e3b1053ac09cb10cdf590cfaf3e9
http://depositonce.tu-berlin.de/handle/11303/2646
http://depositonce.tu-berlin.de/handle/11303/2646
Autor:
Gellert, Torsten J., König, Felix G.
Systems of rail-mounted vehicles play a key role in many logistics applications, and the efficiency of their operation frequently has a significant impact on the overall performance of the surrounding production environment. In theory, assigning tran
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______793::68f4a2eb337c0fcb99c1d94f0c0f9585
https://depositonce.tu-berlin.de/handle/11303/15681
https://depositonce.tu-berlin.de/handle/11303/15681
An approximation algorithm for an optimization problem runs in polynomial time for all instances and is guaranteed to deliver solutions with bounded optimality gap. We derive such algorithms for different variants of capacitated location routing, an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______793::cca4f3d2150fe6c38c752ebd150c0500
https://depositonce.tu-berlin.de/handle/11303/15695
https://depositonce.tu-berlin.de/handle/11303/15695
We study two related problems in non-preemptive scheduling and packing of malleable tasks with precedence constraints to minimize the makespan. We distinguish the scheduling variant, in which we allow the free choice of processors, and the packing va
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______793::0b80887f3a69bf388b1c8a1c06f6de4c
https://depositonce.tu-berlin.de/handle/11303/15659
https://depositonce.tu-berlin.de/handle/11303/15659
We consider a complex planning problem in integrated steel production. A sequence of coils of sheet metal needs to be color coated in consecutive stages. Different coil geometries and changes of coatings may necessitate time-consuming setup work. In
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______793::f4b767e0c728adc0c8d822e69e53f951
https://depositonce.tu-berlin.de/handle/11303/15677
https://depositonce.tu-berlin.de/handle/11303/15677