 | 2007 |
|---|
| 12 |       | Vincent T'Kindt,
Karima Bouibede-Hocine,
Carl Esswein:
Counting and enumeration complexity with application to multicriteria scheduling.
Annals OR 153(1): 215-234 (2007) |
| 11 | | Vincent T'Kindt,
Federico Della Croce,
Jean-Louis Bouquard:
Enumeration of Pareto Optima for a Flowshop Scheduling Problem with Two Criteria.
INFORMS Journal on Computing 19(1): 64-72 (2007) |
| 2006 |
|---|
| 10 | | Vincent T'Kindt:
J.Y.-T. Leung, Handbook of Scheduling: Algorithms, Models and Performance Analysis, Computer and Information Science series.
European Journal of Operational Research 170(3): 1018-1022 (2006) |
| 9 | | B. Esteve,
C. Aubijoux,
A. Chartier,
Vincent T'Kindt:
A recovering beam search algorithm for the single machine Just-in-Time scheduling problem.
European Journal of Operational Research 172(3): 798-813 (2006) |
| 2005 |
|---|
| 8 | | Vincent T'Kindt,
Karima Bouibede-Hocine,
Carl Esswein:
Counting and enumeration complexity with application to multicriteria scheduling.
4OR 3(1): 1-21 (2005) |
| 7 | | 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.
Decision Support Systems 40(2): 329-337 (2005) |
| 6 | | Vincent T'Kindt,
Jean-Charles Billaut:
Multicriteria scheduling.
European Journal of Operational Research 167(3): 589-591 (2005) |
| 2004 |
|---|
| 5 | | Xavier Gandibleux,
Xavier Delorme,
Vincent T'Kindt:
An Ant Colony Optimisation Algorithm for the Set Packing Problem.
ANTS Workshop 2004: 49-60 |
| 4 | | Vincent T'Kindt,
Federico Della Croce,
Carl Esswein:
Revisiting Branch and Bound Search Strategies for Machine Scheduling Problems.
J. Scheduling 7(6): 429-440 (2004) |
| 2003 |
|---|
| 3 | | Vincent T'Kindt,
Jatinder N. D. Gupta,
Jean-Charles Billaut:
Two-machine flowshop scheduling with a secondary criterion.
Computers & OR 30(4): 505-526 (2003) |
| 2 | | 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 |
|---|
| 1 | | Vincent T'Kindt,
Nicolas Monmarché,
Fabrice Tercinet,
Daniel Laügt:
An Ant Colony Optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem.
European Journal of Operational Research 142(2): 250-257 (2002) |
