Vincent T'kindt

73 papers B 4C 6Journal 57Unranked 4

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