T'kindt Vincent

Vincent T'kindt

Information about the author Vincent T'kindt will soon be added to the site.
Found 7 papers in total
A Multicriteria Dial-a-Ride Problem with an Ecological Measure and Heterogeneous Vehicles
A Multicriteria Dial-a-Ride Problem with an Ecological Measure and Heterogeneous Vehicles
2014
The Dial‐a‐Ride Problem is a complex combinatorial optimization problem...
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
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
2012
In this paper we consider the well‐known single machine scheduling problem with...
Enumeration of Pareto Optima for a Flowshop Scheduling Problem with Two Criteria
Enumeration of Pareto Optima for a Flowshop Scheduling Problem with Two Criteria
2007
We consider a two–machine flowshop–scheduling problem with an unknown...
Counting and enumeration complexity with application to multicriteria scheduling
Counting and enumeration complexity with application to multicriteria scheduling
2007
In this paper we tackle an important point of combinatorial optimisation: that of...
Two-machine flowshop scheduling with a secondary criterion
Two-machine flowshop scheduling with a secondary criterion
2003
This paper develops mathematical programming formulations, a branch-and-bound...
An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem
An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem
2002
Consider the 2-machine flowshop scheduling problem with the objective of minimizing...
A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem
A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem
2002
This paper deals with the one-machine dynamic total completion time scheduling...
Papers per page: