default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVincent T'kindt
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j53]Camille Grange
, Michael Poss, Eric Bourreau, Vincent T'kindt, Olivier Ploton:
Moderate exponential-time quantum dynamic programming across the subsets for scheduling problems. Eur. J. Oper. Res. 320(3): 516-526 (2025)- 2024
- [j52]Vincent T'kindt, Federico Della Croce, Alessandro Agnetis:
Single machine adversarial bilevel scheduling problems. Eur. J. Oper. Res. 315(1): 63-72 (2024) - [j51]Alexandre Chanson, Nicolas Labroche, Patrick Marcel, Vincent T'kindt:
Comparison Queries Generation Using Mathematical Programming for Exploratory Data Analysis. IEEE Trans. Knowl. Data Eng. 36(12): 7792-7804 (2024) - 2023
- [j50]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): 1032-1041 (2023) - [j49]Olivier Ploton, Vincent T'kindt:
Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using Inclusion-Exclusion. J. Sched. 26(2): 137-145 (2023) - [c13]Vincent T'kindt:
When Operations Research Meets Databases. ADBIS 2023: 34-41 - [c12]Camille Grange, Eric Bourreau, Michael Poss, Vincent T'kindt:
Quantum Speed-ups for Single-machine Scheduling Problems. GECCO Companion 2023: 2224-2231 - [i3]Elena Rener, Fabio Salassa, Vincent T'kindt:
Single machine rescheduling for new orders: properties and complexity results. CoRR abs/2307.14876 (2023) - 2022
- [j48]Vincent T'kindt, Federico Della Croce, Mathieu Liedloff:
Moderate exponential-time algorithms for scheduling problems. 4OR 20(4): 533-566 (2022) - [j47]Federico Della Croce, Fabio Salassa, Vincent T'kindt:
Exact solution of the two-machine flow shop problem with three operations. Comput. Oper. Res. 138: 105595 (2022) - [j46]Elena Rener, Fabio Salassa, Vincent T'kindt:
Single machine rescheduling for new orders with maximum lateness minimization. Comput. Oper. Res. 144: 105815 (2022) - [j45]Olivier Ploton, Vincent T'kindt:
Exponential-time algorithms for parallel machine scheduling problems. J. Comb. Optim. 44(5): 3405-3418 (2022) - [c11]Alexandre Chanson, Nicolas Labroche, Patrick Marcel, Stefano Rizzi, Vincent T'kindt:
Automatic generation of comparison notebooks for interactive data exploration. EDBT 2022: 2:274-2:284 - 2021
- [j44]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: 125888 (2021) - [j43]Lei Shang, Vincent T'kindt, Federico Della Croce:
Branch & Memorize exact algorithms for sequencing problems: Efficient embedding of memorization into search trees. Comput. Oper. Res. 128: 105171 (2021) - [j42]Yannick Kergosien, Jorge E. Mendoza, Vincent T'kindt:
Special issue on matheuristics. J. Heuristics 27(1-2): 1-3 (2021) - [j41]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): S1747-S1765 (2021) - [c10]Alexandre Chanson, Thomas Devogele, Nicolas Labroche, Patrick Marcel, Nicolas Ringuet, Vincent T'kindt:
A Chain Composite Item Recommender for Lifelong Pathways. DaWaK 2021: 55-66 - [i2]Axel Parmentier, Vincent T'kindt:
Learning to solve the single machine scheduling problem with release times and sum of completion times. CoRR abs/2101.01082 (2021) - 2020
- [j40]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): 764-775 (2020) - [j39]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: 20-28 (2020)
2010 – 2019
- 2019
- [j38]Mostafa Darwiche, Donatello Conte, Romain Raveaux, Vincent T'kindt:
A local branching heuristic for solving a Graph Edit Distance Problem. Comput. Oper. Res. 106: 225-235 (2019) - [j37]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): 608-617 (2019) - [j36]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): 59-68 (2019) - [c9]Mostafa Darwiche, Donatello Conte, Romain Raveaux, Vincent T'kindt:
Solving the Graph Edit Distance Problem with Variable Partitioning Local Search. GbRPR 2019: 67-77 - 2018
- [j35]Lei Shang, Christophe Lenté, Mathieu Liedloff, Vincent T'kindt:
Exact exponential algorithms for 3-machine flowshop scheduling problems. J. Sched. 21(2): 227-233 (2018) - [j34]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: 133-149 (2018) - [c8]Mostafa Darwiche, Romain Raveaux, Donatello Conte, Vincent T'kindt:
Graph Edit Distance in the Exact Context. S+SSPR 2018: 304-314 - 2017
- [j33]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): 898-905 (2017) - [j32]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): 133-140 (2017) - [c7]Mostafa Darwiche, Romain Raveaux, Donatello Conte, Vincent T'kindt:
A Local Branching Heuristic for the Graph Edit Distance Problem. CIARP 2017: 194-202 - [c6]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: 28:1-28:12 - [i1]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 abs/1707.02849 (2017) - 2016
- [j31]Rainer Kolisch, Erik Demeulemeester, Rubén Ruiz García, Vincent T'kindt, Jan Weglarz:
Editorial "Project Management and Scheduling". OR Spectr. 38(2): 279-281 (2016) - [j30]Kaouthar Deghdak, Vincent T'kindt, Jean-Louis Bouquard:
Scheduling evacuation operations. J. Sched. 19(4): 467-478 (2016) - 2015
- [j29]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): 351-352 (2015) - [c5]Aymen Jlassi, Patrick Martineau, Vincent T'kindt:
Offline Scheduling of Map and Reduce Tasks on Hadoop Systems. CLOSER 2015: 178-185 - [c4]Kaouthar Deghdak, Vincent T'kindt, Jean-Louis Bouquard:
Enumeration of Pareto Optima for a Bicriteria Evacuation Scheduling Problem. ICORES 2015: 162-171 - 2014
- [j28]Vincent T'kindt, Emmanuel Néron:
Preface. Ann. Oper. Res. 213(1): 1 (2014) - [j27]Donatas Elvikis, Vincent T'kindt:
Two-agent scheduling on uniform parallel machines with min-max criteria. Ann. Oper. Res. 213(1): 79-94 (2014) - [j26]Xin Tang, Ameur Soukhal, Vincent T'kindt:
Preprocessing for a map sectorization problem by means of mathematical programming. Ann. Oper. Res. 222(1): 551-569 (2014) - [j25]Federico Della Croce, Fabio Salassa, Vincent T'kindt:
A hybrid heuristic approach for single machine scheduling with release times. Comput. Oper. Res. 45: 7-11 (2014) - [c3]Kaouthar Deghdak, Vincent T'kindt, Jean-Louis Bouquard:
Heuristics for Scheduling Evacuation Operations in Case of Natural Disaster. ICORES 2014: 294-300 - [c2]Federico Della Croce, Christos Koulamas, Vincent T'kindt:
A Constraint Generation Approach for the Two-Machine Flow Shop Problem with Jobs Selection. ISCO 2014: 198-207 - 2013
- [j24]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: 13-22 (2013) - 2012
- [j23]Alexander A. Lazarev, Vincent T'kindt, Frank Werner:
Guest Editorial. Comput. Oper. Res. 39(6): 1195-1196 (2012) - [j22]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): 1257-1264 (2012) - [j21]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): 3244-3246 (2012) - [j20]Han Hoogeveen, Christophe Lenté, Vincent T'kindt:
Rescheduling for new orders on a single machine with setup times. Eur. J. Oper. Res. 223(1): 40-46 (2012) - [j19]R. Belaid, Vincent T'kindt, Carl Esswein:
Scheduling batches in flowshop with limited buffers in the shampoo industry. Eur. J. Oper. Res. 223(2): 560-572 (2012) - [j18]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): 353-355 (2012) - 2011
- [j17]Donatas Elvikis, Horst W. Hamacher, Vincent T'kindt:
Scheduling two agents on uniform parallel machines with makespan and cost functions. J. Sched. 14(5): 471-481 (2011) - 2010
- [j16]Federico Della Croce, Vincent T'kindt:
Improving the preemptive bound for the single machine dynamic maximum lateness problem. Oper. Res. Lett. 38(6): 589-591 (2010) - [j15]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): 39-47 (2010)
2000 – 2009
- 2007
- [j14]Vincent T'kindt, Karima Bouibede-Hocine, Carl Esswein:
Counting and enumeration complexity with application to multicriteria scheduling. Ann. Oper. Res. 153(1): 215-234 (2007) - [j13]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): 64-72 (2007) - 2006
- [b1]Vincent T'kindt, Jean-Charles Billaut:
Multicriteria Scheduling - Theory, Models and Algorithms (2. ed.). Springer 2006, ISBN 978-3-540-28230-3, pp. I-XVI, 1-359 - [j12]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): 1018-1022 (2006) - [j11]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): 798-813 (2006) - 2005
- [j10]Vincent T'kindt, Karima Bouibede-Hocine, Carl Esswein:
Counting and enumeration complexity with application to multicriteria scheduling. 4OR 3(1): 1-21 (2005) - [j9]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): 329-337 (2005) - [j8]Vincent T'kindt, Jean-Charles Billaut:
Multicriteria scheduling. Eur. J. Oper. Res. 167(3): 589-591 (2005) - 2004
- [j7]Vincent T'kindt, Federico Della Croce, Carl Esswein:
Revisiting Branch and Bound Search Strategies for Machine Scheduling Problems. J. Sched. 7(6): 429-440 (2004) - [c1]Xavier Gandibleux, Xavier Delorme, Vincent T'kindt:
An Ant Colony Optimisation Algorithm for the Set Packing Problem. ANTS Workshop 2004: 49-60 - [e1]Xavier Gandibleux, Marc Sevaux, Kenneth Sörensen, Vincent T'kindt:
Metaheuristics for Multiobjective Optimisation. Lecture Notes in Economics and Mathematical Systems 535, Springer 2004, ISBN 978-3-540-20637-8 [contents] - 2003
- [j6]Vincent T'kindt, Jatinder N. D. Gupta, Jean-Charles Billaut:
Two-machine flowshop scheduling with a secondary criterion. Comput. Oper. Res. 30(4): 505-526 (2003) - [j5]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): 142-148 (2003) - 2002
- [j4]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): 250-257 (2002) - [j3]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): 1275-1280 (2002) - 2001
- [j2]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): 42-49 (2001) - [j1]Vincent T'kindt, Jean-Charles Billaut:
Multicriteria scheduling problems: a survey. RAIRO Oper. Res. 35(2): 143-163 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-01 01:12 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
