Solving the Multiple Resource Constrained Project Scheduling Problem with a Hybrid Genetic Algorithm. - Éric Ramat; Gilles Venturini; Christophe Lenté; Mohamed Slimane (ICGA, 1997)

Généralisation Max-Plus des bornes de Lageweg, Lenstra et Rinnooy Kan. - Christophe Lenté; Jean-Louis Bouquard (RAIRO Oper. Res., 2003)

Mixed satisfiability tests for multiprocessor scheduling with release dates and deadlines. - Fabrice Tercinet; Christophe Lenté; Emmanuel Néron (Oper. Res. Lett., 2004)

The e-OCEA project: towards an Internet decision system for scheduling problems. - Vincent T'kindt; Jean-Charles Billaut; Jean-Louis Bouquard; Christophe Lenté; Patrick Martineau; Emmanuel Néron; Christian Proust; C. Tacquard (Decis. Support Syst., 2005)

Two-machine flow shop scheduling problems with minimal and maximal delays. - Jean-Louis Bouquard; Christophe Lenté (4OR, 2006)

Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem. - Fabrice Tercinet; Emmanuel Néron; Christophe Lenté (4OR, 2006)

Application of an optimization problem in Max-Plus algebra to scheduling problems. - Jean-Louis Bouquard; Christophe Lenté; Jean-Charles Billaut (Discret. Appl. Math., 2006)

A tabu search heuristic for the dynamic transportation of patients between care units. - Yannick Kergosien; Christophe Lenté; D. Piton; Jean-Charles Billaut (Eur. J. Oper. Res., 2011)

Rescheduling for new orders on a single machine with setup times. - Han Hoogeveen; Christophe Lenté; Vincent T'kindt (Eur. J. Oper. Res., 2012)

Equivalence between Two Flowshop Problems - MaxPlus Approach. - Nhat Vinh Vo; Christophe Lenté (ICORES, 2013)

Metaheuristic algorithms for solving two interconnected vehicle routing problems in a hospital complex. - Yannick Kergosien; Christophe Lenté; Jean-Charles Billaut; Sandrine Perrin (Comput. Oper. Res., 2013)

On an extension of the Sort & Search method with application to scheduling theory. - Christophe Lenté; Mathieu Liedloff; Ameur Soukhal; Vincent T'kindt (Theor. Comput. Sci., 2013)

General Lower Bounds for the Total Completion Time in a Flowshop Scheduling Problem - MaxPlus Approach. - Nhat Vinh Vo; Pauline Fouillet; Christophe Lenté (ICORES, 2014)

Elaboration of General Lower Bounds for the Total Completion Time in Flowshop Scheduling Problems through MaxPlus Approach. - Nhat Vinh Vo; Pauline Fouillet; Christophe Lenté (ICORES (Selected Papers), 2014)

Exact exponential algorithms for 3-machine flowshop scheduling problems. - Lei Shang 001; Christophe Lenté; Mathieu Liedloff; Vincent T'kindt (J. Sched., 2018)

DARTS with Degeneracy Correction. - Guillaume Lacharme; Hubert Cardot; Christophe Lenté; Nicolas Monmarché (IbPRIA, 2023)

The limitations of differentiable architecture search. - Guillaume Lacharme; Hubert Cardot; Christophe Lenté; Nicolas Monmarché (Pattern Anal. Appl., 2024)