Vincent T'kindt
Orcid: 0000-0002-7440-2980
According to our database1,
Vincent T'kindt
authored at least 69 papers
between 2001 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
-
on id.loc.gov
-
on d-nb.info
On csauthors.net:
Bibliography
2025
Moderate exponential-time quantum dynamic programming across the subsets for scheduling problems.
Eur. J. Oper. Res., 2025
2024
Comparison Queries Generation Using Mathematical Programming for Exploratory Data Analysis.
IEEE Trans. Knowl. Data Eng., December, 2024
2023
Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using Inclusion-Exclusion.
J. Sched., 2023
Structured learning based heuristics to solve the single machine scheduling problem with release times and sum of completion times.
Eur. J. Oper. Res., 2023
CoRR, 2023
Proceedings of the Companion Proceedings of the Conference on Genetic and Evolutionary Computation, 2023
Proceedings of the Advances in Databases and Information Systems, 2023
2022
J. Comb. Optim., 2022
Comput. Oper. Res., 2022
Comput. Oper. Res., 2022
Proceedings of the 25th International Conference on Extending Database Technology, 2022
2021
Solving a time-indexed formulation for an unrelated parallel machine scheduling problem by preprocessing and cutting planes.
RAIRO Oper. Res., 2021
Learning to solve the single machine scheduling problem with release times and sum of completion times.
CoRR, 2021
<i>Branch</i> & <i>Memorize</i> exact algorithms for sequencing problems: Efficient embedding of memorization into search trees.
Comput. Oper. Res., 2021
Parallel machine scheduling with minimum number of tardy jobs: Approximation and exponential algorithms.
Appl. Math. Comput., 2021
Proceedings of the Big Data Analytics and Knowledge Discovery, 2021
2020
Pattern Recognit. Lett., 2020
Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights.
J. Comb. Optim., 2020
2019
No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths.
J. Sched., 2019
A tight linear time $$\frac{13}{12}$$ -approximation algorithm for the $$P2 || C_{\max }$$ problem.
J. Comb. Optim., 2019
Comput. Oper. Res., 2019
Proceedings of the Graph-Based Representations in Pattern Recognition, 2019
2018
An exact exponential branch-and-merge algorithm for the single machine total tardiness problem.
Theor. Comput. Sci., 2018
J. Sched., 2018
Proceedings of the Structural, Syntactic, and Statistical Pattern Recognition, 2018
2017
J. Comb. Optim., 2017
Eur. J. Oper. Res., 2017
No-idle, no-wait: when shop scheduling meets dominoes, eulerian and hamiltonian paths.
CoRR, 2017
Merging Nodes in Search Trees: an Exact Exponential Algorithm for the Single Machine Total Tardiness Scheduling Problem.
Proceedings of the 12th International Symposium on Parameterized and Exact Computation, 2017
Proceedings of the Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications, 2017
2016
2015
Erratum - One Machine Sequencing to Minimize Total Tardiness: A Fourth Theorem for Emmons.
Oper. Res., 2015
Enumeration of Pareto Optima for a Bicriteria Evacuation Scheduling Problem.
Proceedings of the ICORES 2015, 2015
Proceedings of the CLOSER 2015, 2015
2014
Comput. Oper. Res., 2014
Ann. Oper. Res., 2014
Ann. Oper. Res., 2014
A Constraint Generation Approach for the Two-Machine Flow Shop Problem with Jobs Selection.
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014
Proceedings of the ICORES 2014, 2014
2013
Theor. Comput. Sci., 2013
2012
Oper. Res. Lett., 2012
Eur. J. Oper. Res., 2012
Eur. J. Oper. Res., 2012
A note on "Two-machine flow-shop scheduling with rejection" and its link with flow-shop scheduling and common due date assignment.
Comput. Oper. Res., 2012
Coupling Genetic Local Search and Recovering Beam Search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates.
Comput. Oper. Res., 2012
2011
J. Sched., 2011
2010
Sequencing a single machine with due dates and deadlines: an ILP-based approach to solve very large instances.
J. Sched., 2010
Improving the preemptive bound for the single machine dynamic maximum lateness problem.
Oper. Res. Lett., 2010
2007
INFORMS J. Comput., 2007
2006
J.Y.-T. Leung, Handbook of Scheduling: Algorithms, Models and Performance Analysis, Computer and Information Science series.
Eur. J. Oper. Res., 2006
A recovering beam search algorithm for the single machine Just-in-Time scheduling problem.
Eur. J. Oper. Res., 2006
Springer, ISBN: 978-3-540-28230-3, 2006
2005
Decis. Support Syst., 2005
4OR, 2005
2004
J. Sched., 2004
Proceedings of the Ant Colony Optimization and Swarm Intelligence, 2004
2003
Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem.
Oper. Res. Lett., 2003
2002
A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem.
J. Oper. Res. Soc., 2002
An Ant Colony Optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem.
Eur. J. Oper. Res., 2002
2001
Solving a bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industry.
Eur. J. Oper. Res., 2001