Fiber-to-object assignment heuristics. - Francis Sourd; Philippe Chrétienne (Eur. J. Oper. Res., 1999)

Multiple-Machine Lower Bounds for Shop-Scheduling Problems. - Francis Sourd; Wim Nuijten (INFORMS J. Comput., 2000)

Preemptive Scheduling with Two Minimax Criteria. - Francis Sourd (Ann. Oper. Res., 2001)

Scheduling Tasks on Unrelated Machines: Large Neighborhood Improvement Procedures. - Francis Sourd (J. Heuristics, 2001)

Scheduling chains on a single machine with non-negative time lags. - Alix Munier; Francis Sourd (Math. Methods Oper. Res., 2003)

The One-Machine Problem with Earliness and Tardiness Penalties. - Francis Sourd; Safia Kedad-Sidhoum (J. Sched., 2003)

PERT scheduling with convex cost functions. - Philippe Chrétienne; Francis Sourd (Theor. Comput. Sci., 2003)

Preemptive Multi-Machine Scheduling of Equal-Length Jobs to Minimize the Average Flow Time - Philippe Baptiste; Marek Chrobak; Christoph Dürr; Francis Sourd (CoRR, 2004)

The Continuous Assignment Problem and Its Application to Preemptive and Non-Preemptive Scheduling with Irregular Cost Functions. - Francis Sourd (INFORMS J. Comput., 2004)

Earliness-tardiness scheduling with setup considerations. - Francis Sourd (Comput. Oper. Res., 2005)

Optimal timing of a sequence of tasks with general completion costs. - Francis Sourd (Eur. J. Oper. Res., 2005)

Punctuality and idleness in just-in-time scheduling. - Francis Sourd (Eur. J. Oper. Res., 2005)

Continuous filling and emptying of storage systems in constraint-based scheduling. - Francis Sourd; Jerome Rogerie (Eur. J. Oper. Res., 2005)

Preemptive Scheduling with Position Costs. - Francis Sourd (Algorithmic Oper. Res., 2006)

Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem. - Yann Hendel; Francis Sourd (Eur. J. Oper. Res., 2006)

Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints. - Francis Sourd (Oper. Res. Lett., 2006)

An improved earliness-tardiness timing algorithm. - Yann Hendel; Francis Sourd (Comput. Oper. Res., 2007)

Evolutionary Mesh Numbering: Preliminary Results - Francis Sourd; Marc Schoenauer (CoRR, 2007)

Memory management optimization problems for integrated circuit simulators. - Timothée Bossart; Alix Munier Kordon; Francis Sourd (Discret. Appl. Math., 2007)

Biclique completion problems for multicast network design. - Nathalie Faure; Philippe Chrétienne; Éric Gourdin; Francis Sourd (Discret. Optim., 2007)

Scheduling with periodic availability constraints and irregular cost functions. - Francis Sourd (RAIRO Oper. Res., 2007)

The complexity of mean flow time scheduling problems with release times. - Philippe Baptiste; Peter Brucker; Marek Chrobak; Christoph Dürr; Svetlana A. Kravchenko; Francis Sourd (J. Sched., 2007)

Lagrangian bounds for just-in-time job-shop scheduling. - Philippe Baptiste; Marta Flamini; Francis Sourd (Comput. Oper. Res., 2008)

Search tree based approaches for parallel machine scheduling. - Emmanuel Néron; Fabrice Tercinet; Francis Sourd (Comput. Oper. Res., 2008)

Exponential neighborhood search for a parallel machine scheduling problem. - Yasmín Á. Ríos-Solís; Francis Sourd (Comput. Oper. Res., 2008)

Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates. - Safia Kedad-Sidhoum; Yasmín Á. Ríos-Solís; Francis Sourd (Eur. J. Oper. Res., 2008)

A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem. - Francis Sourd; Olivier Spanjaard (INFORMS J. Comput., 2008)

A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem. - Francis Sourd; Safia Kedad-Sidhoum (J. Sched., 2008)

Single machine scheduling with forbidden start times. - Jean-Charles Billaut; Francis Sourd (4OR, 2009)

A new model for the preemptive earliness-tardiness scheduling problem. - Nina Runge; Francis Sourd (Comput. Oper. Res., 2009)

Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date. - Celso S. Sakuraba; Débora P. Ronconi; Francis Sourd (Comput. Oper. Res., 2009)

On maximizing the profit of a satellite launcher: Selecting and scheduling tasks with time windows and setups. - J. Meng-Gérard; Philippe Chrétienne; Philippe Baptiste; Francis Sourd (Discret. Appl. Math., 2009)

The one-machine just-in-time scheduling problem with preemption. - Yann Hendel; Nina Runge; Francis Sourd (Discret. Optim., 2009)

New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling. - Francis Sourd (INFORMS J. Comput., 2009)

Preface. - Philippe Baptiste; Graham Kendall; Alix Munier; Francis Sourd (J. Sched., 2009)

A DFO technique to calibrate queueing models. - Thomas Begin; Bruno Baynat; Francis Sourd; Alexandre Brandwajn (Comput. Oper. Res., 2010)

Fast neighborhood search for the single machine earliness-tardiness scheduling problem. - Safia Kedad-Sidhoum; Francis Sourd (Comput. Oper. Res., 2010)

Lexicographically minimizing axial motions for the Euclidean TSP. - Francis Sourd (J. Comb. Optim., 2010)