Solving a bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industry. - Vincent T'kindt; Jean-Charles Billaut; Christian Proust (Eur. J. Oper. Res., 2001)

Multicriteria scheduling problems: a survey. - Vincent T'kindt; Jean-Charles Billaut (RAIRO Oper. Res., 2001)

An Ant Colony Optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem. - Vincent T'kindt; Nicolas Monmarché; Fabrice Tercinet; Daniel Laügt (Eur. J. Oper. Res., 2002)

A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem. - Federico Della Croce; Vincent T'kindt (J. Oper. Res. Soc., 2002)

Two-machine flowshop scheduling with a secondary criterion. - Vincent T'kindt; Jatinder N. D. Gupta; Jean-Charles Billaut (Comput. Oper. Res., 2003)

Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem. - Federico Della Croce; Vincent T'kindt (Oper. Res. Lett., 2003)

An Ant Colony Optimisation Algorithm for the Set Packing Problem. - Xavier Gandibleux; Xavier Delorme; Vincent T'kindt (ANTS Workshop, 2004)

Revisiting Branch and Bound Search Strategies for Machine Scheduling Problems. - Vincent T'kindt; Federico Della Croce; Carl Esswein (J. Sched., 2004)

Counting and enumeration complexity with application to multicriteria scheduling. - Vincent T'kindt; Karima Bouibede-Hocine; Carl Esswein (4OR, 2005)

The e-OCEA project: towards an Internet decision system for scheduling problems. - Vincent T'kindt; Jean-Charles Billaut; Jean-Louis Bouquard; Christophe Lenté; Patrick Martineau; Emmanuel Néron; Christian Proust; C. Tacquard (Decis. Support Syst., 2005)

Multicriteria scheduling. - Vincent T'kindt; Jean-Charles Billaut (Eur. J. Oper. Res., 2005)

Multicriteria Scheduling - Theory, Models and Algorithms (2. ed.). - Vincent T'kindt; Jean-Charles Billaut (Springer, 2006)

A recovering beam search algorithm for the single machine Just-in-Time scheduling problem. - B. Esteve; C. Aubijoux; A. Chartier; Vincent T'kindt (Eur. J. Oper. Res., 2006)

J.Y.-T. Leung, Handbook of Scheduling: Algorithms, Models and Performance Analysis, Computer and Information Science series. - Vincent T'kindt (Eur. J. Oper. Res., 2006)

Enumeration of Pareto Optima for a Flowshop Scheduling Problem with Two Criteria. - Vincent T'kindt; Federico Della Croce; Jean-Louis Bouquard (INFORMS J. Comput., 2007)

Improving the preemptive bound for the single machine dynamic maximum lateness problem. - Federico Della Croce; Vincent T'kindt (Oper. Res. Lett., 2010)

Sequencing a single machine with due dates and deadlines: an ILP-based approach to solve very large instances. - Philippe Baptiste; Federico Della Croce; Andrea Grosso; Vincent T'kindt (J. Sched., 2010)

Scheduling two agents on uniform parallel machines with makespan and cost functions. - Donatas Elvikis; Horst W. Hamacher; Vincent T'kindt (J. Sched., 2011)

Guest Editorial. - Alexander A. Lazarev; Vincent T'kindt; Frank Werner 001 (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. - Mohamed Ali Rakrouki; Talel Ladhari; Vincent T'kindt (Comput. 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. - Vincent T'kindt; Federico Della Croce (Comput. Oper. Res., 2012)

Scheduling batches in flowshop with limited buffers in the shampoo industry. - R. Belaid; Vincent T'kindt; Carl Esswein (Eur. J. Oper. Res., 2012)

Rescheduling for new orders on a single machine with setup times. - Han Hoogeveen; Christophe Lenté; Vincent T'kindt (Eur. J. Oper. Res., 2012)

Minimizing the number of late jobs when the start time of the machine is variable. - Han Hoogeveen; Vincent T'kindt (Oper. Res. Lett., 2012)

On an extension of the Sort & Search method with application to scheduling theory. - Christophe Lenté; Mathieu Liedloff; Ameur Soukhal; Vincent T'kindt (Theor. Comput. Sci., 2013)

Heuristics for Scheduling Evacuation Operations in Case of Natural Disaster. - Kaouthar Deghdak; Vincent T'kindt; Jean-Louis Bouquard (ICORES, 2014)

A Constraint Generation Approach for the Two-Machine Flow Shop Problem with Jobs Selection. - Federico Della Croce; Christos Koulamas; Vincent T'kindt (ISCO, 2014)

Two-agent scheduling on uniform parallel machines with min-max criteria. - Donatas Elvikis; Vincent T'kindt (Ann. Oper. Res., 2014)

Preface. - Vincent T'kindt; Emmanuel Néron (Ann. Oper. Res., 2014)

Preprocessing for a map sectorization problem by means of mathematical programming. - Xin Tang; Ameur Soukhal; Vincent T'kindt (Ann. Oper. Res., 2014)

A hybrid heuristic approach for single machine scheduling with release times. - Federico Della Croce; Fabio Salassa; Vincent T'kindt (Comput. Oper. Res., 2014)

Offline Scheduling of Map and Reduce Tasks on Hadoop Systems. - Aymen Jlassi; Patrick Martineau; Vincent T'kindt (CLOSER, 2015)

Enumeration of Pareto Optima for a Bicriteria Evacuation Scheduling Problem. - Kaouthar Deghdak; Vincent T'kindt; Jean-Louis Bouquard (ICORES, 2015)

Erratum - One Machine Sequencing to Minimize Total Tardiness: A Fourth Theorem for Emmons. - John J. Kanet; Federico Della Croce; Christos Koulamas; Vincent T'kindt (Oper. Res., 2015)

Editorial "Project Management and Scheduling". - Rainer Kolisch; Erik Demeulemeester; Rubén Ruiz García; Vincent T'kindt; Jan Weglarz (OR Spectr., 2016)

Scheduling evacuation operations. - Kaouthar Deghdak; Vincent T'kindt; Jean-Louis Bouquard (J. Sched., 2016)

A Local Branching Heuristic for the Graph Edit Distance Problem. - Mostafa Darwiche; Romain Raveaux; Donatello Conte; Vincent T'kindt (CIARP, 2017)

Merging Nodes in Search Trees: an Exact Exponential Algorithm for the Single Machine Total Tardiness Scheduling Problem. - Lei Shang 001; Michele Garraffa; Federico Della Croce; Vincent T'kindt (IPEC, 2017)

No-idle, no-wait: when shop scheduling meets dominoes, eulerian and hamiltonian paths. - Jean-Charles Billaut; Federico Della Croce; Fabio Salassa; Vincent T'kindt (CoRR, 2017)

A constraint generation approach for two-machine shop problems with jobs selection. - Federico Della Croce; Christos Koulamas; Vincent T'kindt (Eur. J. Oper. Res., 2017)

Minimizing the number of tardy jobs in two-machine settings with common due date. - Federico Della Croce; Christos Koulamas; Vincent T'kindt (J. Comb. Optim., 2017)

Graph Edit Distance in the Exact Context. - Mostafa Darwiche; Romain Raveaux; Donatello Conte; Vincent T'kindt (S+SSPR, 2018)

Exact exponential algorithms for 3-machine flowshop scheduling problems. - Lei Shang 001; Christophe Lenté; Mathieu Liedloff; Vincent T'kindt (J. Sched., 2018)

An exact exponential branch-and-merge algorithm for the single machine total tardiness problem. - Michele Garraffa; Lei Shang 001; Federico Della Croce; Vincent T'kindt (Theor. Comput. Sci., 2018)

Solving the Graph Edit Distance Problem with Variable Partitioning Local Search. - Mostafa Darwiche; Donatello Conte; Romain Raveaux; Vincent T'kindt (GbRPR, 2019)

A local branching heuristic for solving a Graph Edit Distance Problem. - Mostafa Darwiche; Donatello Conte; Romain Raveaux; Vincent T'kindt (Comput. Oper. Res., 2019)

A tight linear time $$ frac{13}{12}$$ -approximation algorithm for the $$P2 || C_{ max }$$ problem. - Federico Della Croce; Rosario Scatamacchia; Vincent T'kindt (J. Comb. Optim., 2019)

No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths. - Jean-Charles Billaut; Federico Della Croce; Fabio Salassa; Vincent T'kindt (J. Sched., 2019)

Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights. - Vincent T'kindt; Lei Shang 001; Federico Della Croce (J. Comb. Optim., 2020)

Graph edit distance: Accuracy of local branching from an application point of view. - Mostafa Darwiche; Donatello Conte; Romain Raveaux; Vincent T'kindt (Pattern Recognit. Lett., 2020)

A Chain Composite Item Recommender for Lifelong Pathways. - Alexandre Chanson; Thomas Devogele; Nicolas Labroche; Patrick Marcel; Nicolas Ringuet; Vincent T'kindt (DaWaK, 2021)

Parallel machine scheduling with minimum number of tardy jobs: Approximation and exponential algorithms. - Federico Della Croce; Vincent T'kindt; Olivier Ploton (Appl. Math. Comput., 2021)

Branch & Memorize exact algorithms for sequencing problems: Efficient embedding of memorization into search trees. - Lei Shang 001; Vincent T'kindt; Federico Della Croce (Comput. Oper. Res., 2021)

Learning to solve the single machine scheduling problem with release times and sum of completion times. - Axel Parmentier; Vincent T'kindt (CoRR, 2021)

Special issue on matheuristics. - Yannick Kergosien; Jorge E. Mendoza; Vincent T'kindt (J. Heuristics, 2021)

Solving a time-indexed formulation for an unrelated parallel machine scheduling problem by preprocessing and cutting planes. - Lotte Berghman; Frits C. R. Spieksma; Vincent T'kindt (RAIRO Oper. Res., 2021)

Automatic generation of comparison notebooks for interactive data exploration. - Alexandre Chanson; Nicolas Labroche; Patrick Marcel; Stefano Rizzi; Vincent T'kindt (EDBT, 2022)

Moderate exponential-time algorithms for scheduling problems. - Vincent T'kindt; Federico Della Croce; Mathieu Liedloff (4OR, 2022)

Exact solution of the two-machine flow shop problem with three operations. - Federico Della Croce; Fabio Salassa; Vincent T'kindt (Comput. Oper. Res., 2022)

Single machine rescheduling for new orders with maximum lateness minimization. - Elena Rener; Fabio Salassa; Vincent T'kindt (Comput. Oper. Res., 2022)

Exponential-time algorithms for parallel machine scheduling problems. - Olivier Ploton; Vincent T'kindt (J. Comb. Optim., 2022)

When Operations Research Meets Databases. - Vincent T'kindt (ADBIS, 2023)

Quantum Speed-ups for Single-machine Scheduling Problems. - Camille Grange 002; Eric Bourreau; Michael Poss; Vincent T'kindt (GECCO Companion, 2023)

Single machine rescheduling for new orders: properties and complexity results. - Elena Rener; Fabio Salassa; Vincent T'kindt (CoRR, 2023)

Structured learning based heuristics to solve the single machine scheduling problem with release times and sum of completion times. - Axel Parmentier; Vincent T'kindt (Eur. J. Oper. Res., 2023)

Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using Inclusion-Exclusion. - Olivier Ploton; Vincent T'kindt (J. Sched., 2023)

Single machine adversarial bilevel scheduling problems. - Vincent T'kindt; Federico Della Croce; Alessandro Agnetis (Eur. J. Oper. Res., 2024)

Comparison Queries Generation Using Mathematical Programming for Exploratory Data Analysis. - Alexandre Chanson; Nicolas Labroche; Patrick Marcel; Vincent T'kindt (IEEE Trans. Knowl. Data Eng., 2024)

Can Operations Research bring you to the next level? Basics and application. - Vincent T'kindt; Patrick Marcel (EDBT, 2025)

Moderate exponential-time quantum dynamic programming across the subsets for scheduling problems. - Camille Grange 002; Michael Poss; Eric Bourreau; Vincent T'kindt; Olivier Ploton (Eur. J. Oper. Res., 2025)