( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Online Scheduling with Increasing Subsequence Serving Constraint.

, , и . FAW, том 9711 из Lecture Notes in Computer Science, стр. 135-144. Springer, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Eva Kelin-Kodal

Sameh Keliny

Kelin Guo

Jia Luo

Yongxiang Luo

 

Другие публикации лиц с тем же именем

Car-Sharing on a Star Network: On-Line Scheduling with k Servers., , и . STACS, том 126 из LIPIcs, стр. 51:1-51:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Minimizing the Maximum Flow Time in the Online Food Delivery Problem., , , и . ISAAC, том 248 из LIPIcs, стр. 33:1-33:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)The Minimum Acceptable Violation Ranking of Alternatives from Voters' Ordinal Rankings., и . COCOA, том 9486 из Lecture Notes in Computer Science, стр. 758-770. Springer, (2015)Car-sharing between two locations: Online scheduling with flexible advance bookings., , и . Discret. Appl. Math., (2022)Online Bin Packing with Overload Cost., и . CALDAM, том 12601 из Lecture Notes in Computer Science, стр. 3-15. Springer, (2021)Algorithms for Online Car-Sharing Problem., и . CALDAM, том 13179 из Lecture Notes in Computer Science, стр. 224-236. Springer, (2022)Online Scheduling with Increasing Subsequence Serving Constraint., , и . FAW, том 9711 из Lecture Notes in Computer Science, стр. 135-144. Springer, (2016)Creating an acceptable consensus ranking for group decision making., , , и . J. Comb. Optim., 36 (1): 307-328 (2018)On-line Scheduling with a Monotonous Subsequence Constraint., , , и . FAW, том 10336 из Lecture Notes in Computer Science, стр. 187-195. Springer, (2017)Minimizing the Maximum Flow Time in the Online Food Delivery Problem., , , и . Algorithmica, 86 (4): 907-943 (апреля 2024)