( en | de | ru )

 

Disambiguation of "T'kindt, Vincent"

Author of the publication

copydeleteadd this publication to your clipboard
Enumeration of Pareto Optima for a Flowshop Scheduling Problem with Two Criteria.

, , and . INFORMS J. Comput., 19 (1): 64-72 (2007)

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 Fochtman

Vincent Feyen

Vincent Wroblewsky

Vincent Tejedor

Vincent Saderne

 

Other publications of authors with the same name

A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem., and . J. Oper. Res. Soc., 53 (11): 1275-1280 (2002)Editorial "Project Management and Scheduling"., , , , and . OR Spectr., 38 (2): 279-281 (2016)Improving the preemptive bound for the single machine dynamic maximum lateness problem., and . Oper. Res. Lett., 38 (6): 589-591 (2010)Moderate exponential-time algorithms for scheduling problems., , and . 4OR, 20 (4): 533-566 (2022)On an extension of the Sort & Search method with application to scheduling theory., , , and . Theor. Comput. Sci., (2013)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)Scheduling evacuation operations., , and . J. Sched., 19 (4): 467-478 (2016)Single machine rescheduling for new orders: properties and complexity results., , and . CoRR, (2023)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)No-idle, no-wait: when shop scheduling meets dominoes, eulerian and hamiltonian paths., , , and . CoRR, (2017)