( en | de | ru )

 

Disambiguation of "T'kindt, Vincent"

Author of the publication

copydeleteadd this publication to your clipboard
Offline Scheduling of Map and Reduce Tasks on Hadoop Systems.

, , and . CLOSER, page 178-185. SciTePress, (2015)

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. You can also use the button next to the name to display some publications already assigned to the person.

Vincent Kisselbach

Vincent Herrmann

Vincent Fochtman

Vincent Liebert

Vincent Tejedor

 

Other publications of authors with the same name

Improving the preemptive bound for the single machine dynamic maximum lateness problem., and . Oper. Res. Lett., 38 (6): 589-591 (2010)On an extension of the Sort & Search method with application to scheduling theory., , , and . Theor. Comput. Sci., (2013)A Local Branching Heuristic for the Graph Edit Distance Problem., , , and . CIARP, volume 10657 of Lecture Notes in Computer Science, page 194-202. Springer, (2017)A Constraint Generation Approach for the Two-Machine Flow Shop Problem with Jobs Selection., , and . ISCO, volume 8596 of Lecture Notes in Computer Science, page 198-207. Springer, (2014)Multicriteria scheduling, and . Springer, Berlin u.a., (2006)Branch & Memorize exact algorithms for sequencing problems: Efficient embedding of memorization into search trees., , and . Comput. Oper. Res., (2021)Single machine rescheduling for new orders with maximum lateness minimization., , and . Comput. Oper. Res., (2022)Counting and enumeration complexity with application to multicriteria scheduling., , and . 4OR, 3 (1): 1-21 (2005)Graph Edit Distance in the Exact Context., , , and . S+SSPR, volume 11004 of Lecture Notes in Computer Science, page 304-314. Springer, (2018)No-idle, no-wait: when shop scheduling meets dominoes, eulerian and hamiltonian paths., , , and . CoRR, (2017)