Vincent T'kindt

Publication Activity (10 Years)

Years Active: 2001-2024
Publications (10 Years): 36

Top Topics

Scheduling Problem

Top Venues

Comput. Oper. Res.

J. Comb. Optim.

Publications

Vincent T'kindt, Federico Della Croce, Alessandro Agnetis
Single machine adversarial bilevel scheduling problems. Eur. J. Oper. Res. 315 (1) (2024)
Olivier Ploton, Vincent T'kindt
Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using Inclusion-Exclusion. J. Sched. 26 (2) (2023)
Axel Parmentier, Vincent T'kindt
Structured learning based heuristics to solve the single machine scheduling problem with release times and sum of completion times. Eur. J. Oper. Res. 305 (3) (2023)
Elena Rener, Fabio Salassa, Vincent T'kindt
Single machine rescheduling for new orders: properties and complexity results. CoRR (2023)
Camille Grange, Eric Bourreau, Michael Poss, Vincent T'kindt
Quantum Speed-ups for Single-machine Scheduling Problems. GECCO Companion (2023)
Vincent T'kindt
When Operations Research Meets Databases. ADBIS (2023)
Olivier Ploton, Vincent T'kindt
Exponential-time algorithms for parallel machine scheduling problems. J. Comb. Optim. 44 (5) (2022)
Elena Rener, Fabio Salassa, Vincent T'kindt
Single machine rescheduling for new orders with maximum lateness minimization. Comput. Oper. Res. 144 (2022)
Alexandre Chanson, Nicolas Labroche, Patrick Marcel, Stefano Rizzi, Vincent T'kindt
Automatic generation of comparison notebooks for interactive data exploration. EDBT (2022)
Vincent T'kindt, Federico Della Croce, Mathieu Liedloff
Moderate exponential-time algorithms for scheduling problems. 4OR 20 (4) (2022)
Federico Della Croce, Fabio Salassa, Vincent T'kindt
Exact solution of the two-machine flow shop problem with three operations. Comput. Oper. Res. 138 (2022)
Axel Parmentier, Vincent T'kindt
Learning to solve the single machine scheduling problem with release times and sum of completion times. CoRR (2021)
Alexandre Chanson, Thomas Devogele, Nicolas Labroche, Patrick Marcel, Nicolas Ringuet, Vincent T'kindt
A Chain Composite Item Recommender for Lifelong Pathways. DaWaK (2021)
Lei Shang, Vincent T'kindt, Federico Della Croce
exact algorithms for sequencing problems: Efficient embedding of memorization into search trees. Comput. Oper. Res. 128 (2021)
Federico Della Croce, Vincent T'kindt, Olivier Ploton
Parallel machine scheduling with minimum number of tardy jobs: Approximation and exponential algorithms. Appl. Math. Comput. 397 (2021)
Yannick Kergosien, Jorge E. Mendoza, Vincent T'kindt
Special issue on matheuristics. J. Heuristics 27 (1-2) (2021)
Lotte Berghman, Frits C. R. Spieksma, Vincent T'kindt
Solving a time-indexed formulation for an unrelated parallel machine scheduling problem by preprocessing and cutting planes. RAIRO Oper. Res. 55 (Supplement) (2021)
Mostafa Darwiche, Donatello Conte, Romain Raveaux, Vincent T'kindt
Graph edit distance: Accuracy of local branching from an application point of view. Pattern Recognit. Lett. 134 (2020)
Vincent T'kindt, Lei Shang, Federico Della Croce
Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights. J. Comb. Optim. 39 (3) (2020)
Federico Della Croce, Rosario Scatamacchia, Vincent T'kindt
A tight linear time $$\frac{13}{12}$$ -approximation algorithm for the $$P2 || C_{\max }$$ problem. J. Comb. Optim. 38 (2) (2019)
Mostafa Darwiche, Donatello Conte, Romain Raveaux, Vincent T'kindt
Solving the Graph Edit Distance Problem with Variable Partitioning Local Search. GbRPR (2019)
Jean-Charles Billaut, Federico Della Croce, Fabio Salassa, Vincent T'kindt
No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths. J. Sched. 22 (1) (2019)
Mostafa Darwiche, Donatello Conte, Romain Raveaux, Vincent T'kindt
A local branching heuristic for solving a Graph Edit Distance Problem. Comput. Oper. Res. 106 (2019)
Michele Garraffa, Lei Shang, Federico Della Croce, Vincent T'kindt
An exact exponential branch-and-merge algorithm for the single machine total tardiness problem. Theor. Comput. Sci. 745 (2018)
Lei Shang, Christophe Lenté, Mathieu Liedloff, Vincent T'kindt
Exact exponential algorithms for 3-machine flowshop scheduling problems. J. Sched. 21 (2) (2018)
Mostafa Darwiche, Romain Raveaux, Donatello Conte, Vincent T'kindt
Graph Edit Distance in the Exact Context. S+SSPR (2018)
Mostafa Darwiche, Romain Raveaux, Donatello Conte, Vincent T'kindt
A Local Branching Heuristic for the Graph Edit Distance Problem. CIARP (2017)
Jean-Charles Billaut, Federico Della Croce, Fabio Salassa, Vincent T'kindt
No-idle, no-wait: when shop scheduling meets dominoes, eulerian and hamiltonian paths. CoRR (2017)
Federico Della Croce, Christos Koulamas, Vincent T'kindt
A constraint generation approach for two-machine shop problems with jobs selection. Eur. J. Oper. Res. 259 (3) (2017)
Federico Della Croce, Christos Koulamas, Vincent T'kindt
Minimizing the number of tardy jobs in two-machine settings with common due date. J. Comb. Optim. 34 (1) (2017)
Lei Shang, Michele Garraffa, Federico Della Croce, Vincent T'kindt
Merging Nodes in Search Trees: an Exact Exponential Algorithm for the Single Machine Total Tardiness Scheduling Problem. IPEC (2017)
Rainer Kolisch, Erik Demeulemeester, Rubén Ruiz García, Vincent T'kindt, Jan Weglarz
Editorial "Project Management and Scheduling". OR Spectr. 38 (2) (2016)
Kaouthar Deghdak, Vincent T'kindt, Jean-Louis Bouquard
Scheduling evacuation operations. J. Sched. 19 (4) (2016)
Aymen Jlassi, Patrick Martineau, Vincent T'kindt
Offline Scheduling of Map and Reduce Tasks on Hadoop Systems. CLOSER (2015)
John J. Kanet, Federico Della Croce, Christos Koulamas, Vincent T'kindt
Erratum - One Machine Sequencing to Minimize Total Tardiness: A Fourth Theorem for Emmons. Oper. Res. 63 (2) (2015)
Kaouthar Deghdak, Vincent T'kindt, Jean-Louis Bouquard
Enumeration of Pareto Optima for a Bicriteria Evacuation Scheduling Problem. ICORES (2015)
Xin Tang, Ameur Soukhal, Vincent T'kindt
Preprocessing for a map sectorization problem by means of mathematical programming. Ann. Oper. Res. 222 (1) (2014)
Vincent T'kindt, Emmanuel Néron
Preface. Ann. Oper. Res. 213 (1) (2014)
Federico Della Croce, Fabio Salassa, Vincent T'kindt
A hybrid heuristic approach for single machine scheduling with release times. Comput. Oper. Res. 45 (2014)
Donatas Elvikis, Vincent T'kindt
Two-agent scheduling on uniform parallel machines with min-max criteria. Ann. Oper. Res. 213 (1) (2014)
Federico Della Croce, Christos Koulamas, Vincent T'kindt
A Constraint Generation Approach for the Two-Machine Flow Shop Problem with Jobs Selection. ISCO (2014)
Kaouthar Deghdak, Vincent T'kindt, Jean-Louis Bouquard
Heuristics for Scheduling Evacuation Operations in Case of Natural Disaster. ICORES (2014)
Christophe Lenté, Mathieu Liedloff, Ameur Soukhal, Vincent T'kindt
On an extension of the Sort & Search method with application to scheduling theory. Theor. Comput. Sci. 511 (2013)
Alexander A. Lazarev, Vincent T'kindt, Frank Werner
Guest Editorial. Comput. Oper. Res. 39 (6) (2012)
Mohamed Ali Rakrouki, Talel Ladhari, Vincent T'kindt
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. 39 (6) (2012)
Han Hoogeveen, Christophe Lenté, Vincent T'kindt
Rescheduling for new orders on a single machine with setup times. Eur. J. Oper. Res. 223 (1) (2012)
Han Hoogeveen, Vincent T'kindt
Minimizing the number of late jobs when the start time of the machine is variable. Oper. Res. Lett. 40 (5) (2012)
Vincent T'kindt, Federico Della Croce
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. 39 (12) (2012)
R. Belaid, Vincent T'kindt, Carl Esswein
Scheduling batches in flowshop with limited buffers in the shampoo industry. Eur. J. Oper. Res. 223 (2) (2012)
Donatas Elvikis, Horst W. Hamacher, Vincent T'kindt
Scheduling two agents on uniform parallel machines with makespan and cost functions. J. Sched. 14 (5) (2011)
Philippe Baptiste, Federico Della Croce, Andrea Grosso, Vincent T'kindt
Sequencing a single machine with due dates and deadlines: an ILP-based approach to solve very large instances. J. Sched. 13 (1) (2010)
Federico Della Croce, Vincent T'kindt
Improving the preemptive bound for the single machine dynamic maximum lateness problem. Oper. Res. Lett. 38 (6) (2010)
Vincent T'kindt, Federico Della Croce, Jean-Louis Bouquard
Enumeration of Pareto Optima for a Flowshop Scheduling Problem with Two Criteria. INFORMS J. Comput. 19 (1) (2007)
Vincent T'kindt, Karima Bouibede-Hocine, Carl Esswein
Counting and enumeration complexity with application to multicriteria scheduling. Ann. Oper. Res. 153 (1) (2007)
B. Esteve, C. Aubijoux, A. Chartier, Vincent T'kindt
A recovering beam search algorithm for the single machine Just-in-Time scheduling problem. Eur. J. Oper. Res. 172 (3) (2006)
Vincent T'kindt
J.Y.-T. Leung, Handbook of Scheduling: Algorithms, Models and Performance Analysis, Computer and Information Science series. Eur. J. Oper. Res. 170 (3) (2006)
Vincent T'kindt, Karima Bouibede-Hocine, Carl Esswein
Counting and enumeration complexity with application to multicriteria scheduling. 4OR 3 (1) (2005)
Vincent T'kindt, Jean-Charles Billaut, Jean-Louis Bouquard, Christophe Lenté, Patrick Martineau, Emmanuel Néron, Christian Proust, C. Tacquard
The e-OCEA project: towards an Internet decision system for scheduling problems. Decis. Support Syst. 40 (2) (2005)
Vincent T'kindt, Jean-Charles Billaut
Multicriteria scheduling. Eur. J. Oper. Res. 167 (3) (2005)
Xavier Gandibleux, Xavier Delorme, Vincent T'kindt
An Ant Colony Optimisation Algorithm for the Set Packing Problem. ANTS Workshop (2004)
Vincent T'kindt, Federico Della Croce, Carl Esswein
Revisiting Branch and Bound Search Strategies for Machine Scheduling Problems. J. Sched. 7 (6) (2004)
Federico Della Croce, Vincent T'kindt
Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem. Oper. Res. Lett. 31 (2) (2003)
Vincent T'kindt, Jatinder N. D. Gupta, Jean-Charles Billaut
Two-machine flowshop scheduling with a secondary criterion. Comput. Oper. Res. 30 (4) (2003)
Federico Della Croce, Vincent T'kindt
A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem. J. Oper. Res. Soc. 53 (11) (2002)
Vincent T'kindt, Nicolas Monmarché, Fabrice Tercinet, Daniel Laügt
An Ant Colony Optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem. Eur. J. Oper. Res. 142 (2) (2002)
Vincent T'kindt, Jean-Charles Billaut
Multicriteria scheduling problems: a survey. RAIRO Oper. Res. 35 (2) (2001)
Vincent T'kindt, Jean-Charles Billaut, Christian Proust
Solving a bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industry. Eur. J. Oper. Res. 135 (1) (2001)