Francis Sourd

Publication Activity (10 Years)

Years Active: 1999-2010
Publications (10 Years): 0

Publications

Francis Sourd
Lexicographically minimizing axial motions for the Euclidean TSP. J. Comb. Optim. 19 (1) (2010)
Thomas Begin, Bruno Baynat, Francis Sourd, Alexandre Brandwajn
A DFO technique to calibrate queueing models. Comput. Oper. Res. 37 (2) (2010)
Safia Kedad-Sidhoum, Francis Sourd
Fast neighborhood search for the single machine earliness-tardiness scheduling problem. Comput. Oper. Res. 37 (8) (2010)
Celso S. Sakuraba, Débora P. Ronconi, Francis Sourd
Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date. Comput. Oper. Res. 36 (1) (2009)
Francis Sourd
New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling. INFORMS J. Comput. 21 (1) (2009)
Nina Runge, Francis Sourd
A new model for the preemptive earliness-tardiness scheduling problem. Comput. Oper. Res. 36 (7) (2009)
Yann Hendel, Nina Runge, Francis Sourd
The one-machine just-in-time scheduling problem with preemption. Discret. Optim. 6 (1) (2009)
Philippe Baptiste, Graham Kendall, Alix Munier, Francis Sourd
Preface. J. Sched. 12 (6) (2009)
Jean-Charles Billaut, Francis Sourd
Single machine scheduling with forbidden start times. 4OR 7 (1) (2009)
J. Meng-Gérard, Philippe Chrétienne, Philippe Baptiste, Francis Sourd
On maximizing the profit of a satellite launcher: Selecting and scheduling tasks with time windows and setups. Discret. Appl. Math. 157 (17) (2009)
Safia Kedad-Sidhoum, Yasmín Á. Ríos-Solís, Francis Sourd
Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates. Eur. J. Oper. Res. 189 (3) (2008)
Emmanuel Néron, Fabrice Tercinet, Francis Sourd
Search tree based approaches for parallel machine scheduling. Comput. Oper. Res. 35 (4) (2008)
Yasmín Á. Ríos-Solís, Francis Sourd
Exponential neighborhood search for a parallel machine scheduling problem. Comput. Oper. Res. 35 (5) (2008)
Francis Sourd, Safia Kedad-Sidhoum
A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem. J. Sched. 11 (1) (2008)
Francis Sourd, Olivier Spanjaard
A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem. INFORMS J. Comput. 20 (3) (2008)
Philippe Baptiste, Marta Flamini, Francis Sourd
Lagrangian bounds for just-in-time job-shop scheduling. Comput. Oper. Res. 35 (3) (2008)
Yann Hendel, Francis Sourd
An improved earliness-tardiness timing algorithm. Comput. Oper. Res. 34 (10) (2007)
Timothée Bossart, Alix Munier Kordon, Francis Sourd
Memory management optimization problems for integrated circuit simulators. Discret. Appl. Math. 155 (14) (2007)
Francis Sourd, Marc Schoenauer
Evolutionary Mesh Numbering: Preliminary Results CoRR (2007)
Francis Sourd
Scheduling with periodic availability constraints and irregular cost functions. RAIRO Oper. Res. 41 (2) (2007)
Philippe Baptiste, Peter Brucker, Marek Chrobak, Christoph Dürr, Svetlana A. Kravchenko, Francis Sourd
The complexity of mean flow time scheduling problems with release times. J. Sched. 10 (2) (2007)
Nathalie Faure, Philippe Chrétienne, Éric Gourdin, Francis Sourd
Biclique completion problems for multicast network design. Discret. Optim. 4 (3-4) (2007)
Philippe Baptiste, Peter Brucker, Marek Chrobak, Christoph Dürr, Svetlana A. Kravchenko, Francis Sourd
The Complexity of Mean Flow Time Scheduling Problems with Release Times CoRR (2006)
Francis Sourd
Preemptive Scheduling with Position Costs. Algorithmic Oper. Res. 1 (2) (2006)
Yann Hendel, Francis Sourd
Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem. Eur. J. Oper. Res. 173 (1) (2006)
Francis Sourd
Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints. Oper. Res. Lett. 34 (5) (2006)
Francis Sourd
Earliness-tardiness scheduling with setup considerations. Comput. Oper. Res. 32 (2005)
Francis Sourd, Jerome Rogerie
Continuous filling and emptying of storage systems in constraint-based scheduling. Eur. J. Oper. Res. 165 (2) (2005)
Francis Sourd
Punctuality and idleness in just-in-time scheduling. Eur. J. Oper. Res. 167 (3) (2005)
Francis Sourd
Optimal timing of a sequence of tasks with general completion costs. Eur. J. Oper. Res. 165 (1) (2005)
Philippe Baptiste, Marek Chrobak, Christoph Dürr, Francis Sourd
Preemptive Multi-Machine Scheduling of Equal-Length Jobs to Minimize the Average Flow Time CoRR (2004)
Francis Sourd
The Continuous Assignment Problem and Its Application to Preemptive and Non-Preemptive Scheduling with Irregular Cost Functions. INFORMS J. Comput. 16 (2) (2004)
Alix Munier, Francis Sourd
Scheduling chains on a single machine with non-negative time lags. Math. Methods Oper. Res. 57 (1) (2003)
Philippe Chrétienne, Francis Sourd
PERT scheduling with convex cost functions. Theor. Comput. Sci. 292 (1) (2003)
Francis Sourd, Safia Kedad-Sidhoum
The One-Machine Problem with Earliness and Tardiness Penalties. J. Sched. 6 (6) (2003)
Francis Sourd
Preemptive Scheduling with Two Minimax Criteria. Ann. Oper. Res. 107 (1-4) (2001)
Francis Sourd
Scheduling Tasks on Unrelated Machines: Large Neighborhood Improvement Procedures. J. Heuristics 7 (6) (2001)
Francis Sourd, Wim Nuijten
Multiple-Machine Lower Bounds for Shop-Scheduling Problems. INFORMS J. Comput. 12 (4) (2000)
Francis Sourd, Philippe Chrétienne
Fiber-to-object assignment heuristics. Eur. J. Oper. Res. 117 (1) (1999)