Autor der Publikation

Algorithms better than LPT for semi-online scheduling with decreasing processing times.

, , und . Oper. Res. Lett., 40 (5): 349-352 (2012)

Bitte wählen Sie eine Person um die Publikation zuzuordnen

Um zwischen Personen mit demselben Namen zu unterscheiden, wird der akademische Grad und der Titel einer wichtigen Publikation angezeigt. Zudem lassen sich über den Button neben dem Namen einige der Person bereits zugeordnete Publikationen anzeigen.

apl. Prof. Dr. -Ing. Niels Hansen University of Stuttgart

Replication Data for: Biocatalytic stereocontrolled head-to-tail cyclizations of unbiased terpenes as a tool in chemoenzymatic synthesis, und . Dataset, (2024)Related to: Schneider, Andreas; Lystbæk, Thomas B.; Markthaler, Daniel; Hansen, Niels; Hauer, Bernhard (2024): Biocatalytic stereocontrolled head-to-tail cyclizations of unbiased terpenes as a tool in chemoenzymatic synthesis. In: Nature Communications, 15, 4925. doi: 10.1038/s41467-024-48993-9.
Replication Data for: Biocatalytic stereocontrolled head-to-tail cyclizations of unbiased terpenes as a tool in chemoenzymatic synthesis, und . Dataset, (2024)Related to: Schneider, Andreas; Lystbæk, Thomas B.; Markthaler, Daniel; Hansen, Niels; Hauer, Bernhard (2024): Biocatalytic stereocontrolled head-to-tail cyclizations of unbiased terpenes as a tool in chemoenzymatic synthesis. In: Nature Communications, 15, 4925. doi: 10.1038/s41467-024-48993-9.Biocatalytic stereocontrolled head-to-tail cyclizations of unbiased terpenes as a tool in chemoenzymatic synthesis, , , , und . Nature Communications, 15 (1): 4925 (10.06.2024)
 

Weitere Publikationen von Autoren mit dem selben Namen

Using weight decision for decreasing the price of anarchy in selfish bin packing games., , und . European Journal of Operational Research, 278 (1): 160-169 (2019)A 3/4-Approximation Algorithm for Multiple Subset Sum., , und . J. Heuristics, 9 (2): 99-111 (2003)An Efficient Approximation Scheme for the Subset-Sum Problem., , und . ISAAC, Volume 1350 von Lecture Notes in Computer Science, Seite 394-403. Springer, (1997)Bin Packing Games with Weight Decision: How to Get a Small Value for the Price of Anarchy., , und . WAOA, Volume 11312 von Lecture Notes in Computer Science, Seite 204-217. Springer, (2018)Lower Bounds and Semi On-line Multiprocessor Scheduling., , und . The Computer Science Journal of Moldova, 11 (2): 209-228 (2003)Online Results for Black and White Bin Packing., , , , , und . Theory Comput. Syst., 56 (1): 137-155 (2015)An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing., und . Oper. Res. Lett., 31 (1): 35-41 (2003)An approximation algorithm for identical parallel machine scheduling with resource dependent processing times.. Oper. Res. Lett., 36 (2): 157-159 (2008)An efficient algorithm for bin stretching., und . Oper. Res. Lett., 41 (4): 343-346 (2013)Selecting Portfolios with Fixed Costs and Minimum Transaction Lots., , und . Annals OR, 99 (1-4): 287-304 (2000)