Vincent T'kindt

From MaRDI portal
Person:309070

Available identifiers

zbMath Open tkindt.vincentMaRDI QIDQ309070

List of research outcomes

PublicationDate of PublicationType
Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using inclusion-exclusion2023-06-27Paper
Structured learning based heuristics to solve the single machine scheduling problem with release times and sum of completion times2022-12-12Paper
Moderate exponential-time algorithms for scheduling problems2022-11-17Paper
Single machine rescheduling for new orders with maximum lateness minimization2022-06-22Paper
Exact solution of the two-machine flow shop problem with three operations2022-03-09Paper
Parallel machine scheduling with minimum number of tardy jobs: approximation and exponential algorithms2021-11-09Paper
Solving a time-indexed formulation for an unrelated parallel machine scheduling problem by preprocessing and cutting planes2021-07-27Paper
\textit{Branch} \& \textit{Memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees2021-05-21Paper
https://portal.mardi4nfdi.de/entity/Q51118882020-05-27Paper
Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights2020-03-24Paper
No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths2019-10-08Paper
A tight linear time \(\frac{13}{12}\)-approximation algorithm for the \(P2 || C_{\max}\) problem2019-06-25Paper
A local branching heuristic for solving a graph edit distance problem2019-03-27Paper
An exact exponential branch-and-merge algorithm for the single machine total tardiness problem2018-09-24Paper
A constraint generation approach for two-machine shop problems with jobs selection2018-05-25Paper
Exact exponential algorithms for 3-machine flowshop scheduling problems2018-04-13Paper
Minimizing the number of tardy jobs in two-machine settings with common due date2017-10-17Paper
A note on ``Two-machine flow-shop scheduling with rejection and its link with flow-shop scheduling and common due date assignment2016-11-11Paper
A hybrid heuristic approach for single machine scheduling with release times2016-11-10Paper
Scheduling evacuation operations2016-09-07Paper
Erratum—One Machine Sequencing to Minimize Total Tardiness: A Fourth Theorem for Emmons2015-11-20Paper
A Constraint Generation Approach for the Two-Machine Flow Shop Problem with Jobs Selection2015-10-16Paper
Preprocessing for a map sectorization problem by means of mathematical programming2015-01-22Paper
Two-agent scheduling on uniform parallel machines with min-max criteria2014-09-26Paper
Scheduling batches in flowshop with limited buffers in the shampoo industry2014-07-27Paper
Scheduling two agents on uniform parallel machines with~makespan and cost functions2014-02-05Paper
On an extension of the Sort \& Search method with application to scheduling theory2014-01-13Paper
Rescheduling for new orders on a single machine with setup times2012-12-29Paper
Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates2012-11-15Paper
Minimizing the number of late jobs when the start time of the machine is variable2012-11-08Paper
Enumeration of Pareto Optima for a Flowshop Scheduling Problem with Two Criteria2012-06-18Paper
Multicriteria models for just-in-time scheduling2011-05-10Paper
Improving the preemptive bound for the single machine dynamic maximum lateness problem2010-12-23Paper
Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances2010-05-07Paper
Counting and enumeration complexity with application to multicriteria scheduling2008-03-31Paper
Revisiting branch and bound search strategies for machine scheduling problems2007-12-20Paper
https://portal.mardi4nfdi.de/entity/Q34254942007-02-23Paper
A recovering beam search algorithm for the single machine just-in-time scheduling problem2006-05-16Paper
https://portal.mardi4nfdi.de/entity/Q33789532006-04-05Paper
Counting and enumeration complexity with application to multicriteria scheduling2005-08-25Paper
https://portal.mardi4nfdi.de/entity/Q46705772005-04-22Paper
A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem2005-03-14Paper
Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem.2003-11-17Paper
Two-machine flowshop scheduling with a secondary criterion2003-05-14Paper
An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem2002-11-20Paper
Multicriteria scheduling problems: a survey2002-04-21Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Vincent T'kindt