F. Sourd

发表

A new model for the preemptive earliness-tardiness scheduling problem

Francis Sourd, Nina Runge, Nina Runge, 2009, Comput. Oper. Res..

The One-Machine Problem with Earliness and Tardiness Penalties

Safia Kedad-Sidhoum, Francis Sourd, F. Sourd, 2003, J. Sched..

A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem

Francis Sourd, Olivier Spanjaard, Olivier Spanjaard, 2008, INFORMS J. Comput..

Multi-objective branch and bound. Application to the bi-objective spanning tree problem

Francis Sourd, Patrice Perny, Olivier Spanjaard, 2006 .

PYM: a new, affordable, image-based method using a Raspberry Pi to phenotype plant leaf area in a wide diversity of environments

M. Dauzat, P. Hamard, T. Simonneau, 2017, Plant Methods.

Application to the bi-objective spanning tree problem

Olivier Spanjaard, F. Sourd, 2007 .

The Job-shop Scheduling Problem the Job-shop Scheduling Problem with Setup Times

F. Sourd, 1998 .

A new lower bound for one-machine earliness-tardiness scheduling

F. Sourd, 2007 .

Increasing the total productivity of a land by combining mobile photovoltaic panels and food crops

P. Hamard, T. Simonneau, F. Sourd, 2017 .

An improved earliness-tardiness timing algorithm

Francis Sourd, Yann Hendel, F. Sourd, 2007, Comput. Oper. Res..

Evolutionary Mesh Numbering: Preliminary Results pdf

Francis Sourd, Marc Schoenauer, Marc Schoenauer, 1998, ArXiv.

Exponential neighborhood search for a parallel machine scheduling problem

Yasmin A. Rios-Solis, Francis Sourd, F. Sourd, 2008, Comput. Oper. Res..

Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates

Safia Kedad-Sidhoum, Yasmin A. Rios-Solis, Francis Sourd, 2008, Eur. J. Oper. Res..

Earliness-tardiness scheduling with setup considerations

Francis Sourd, F. Sourd, 2005, Comput. Oper. Res..

The Continuous Assignment Problem and Its Application to Preemptive and Non-Preemptive Scheduling with Irregular Cost Functions

Francis Sourd, F. Sourd, 2004, INFORMS J. Comput..

Lower bounds for the earliness-tardiness scheduling problem on single and parallel machines Sa a

Francis Sourd, F. Sourd, Kedad-Sidhoum, 2004 .

Lagrangian bounds for just-in-time job-shop scheduling

Philippe Baptiste, Francis Sourd, Marta Flamini, 2008, Comput. Oper. Res..

A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem

Safia Kedad-Sidhoum, Francis Sourd, F. Sourd, 2008, J. Sched..

An efficient algorithm for the earliness-tardiness scheduling problem

Francis Sourd, F. Sourd, 2005 .

Lagrangean Bounds and Lagrangean Heuristics for Just In Time Job-Shop Scheduling

P. Baptiste, F. Sourd, M. Flamini, 2005 .

A new branch-and-bound algorithm for the minimization of earliness and tardiness penalties on a single machine

F. Sourd, S. Kedad-Sidhoum, 2005 .

Fast neighborhood search for the single machine earliness-tardiness scheduling problem

Safia Kedad-Sidhoum, Francis Sourd, F. Sourd, 2008, Comput. Oper. Res..

The one-machine just-in-time scheduling problem with preemption

Francis Sourd, Nina Runge, Yann Hendel, 2009, Discret. Optim..

A DFO technique to calibrate queueing models

Francis Sourd, Bruno Baynat, Thomas Begin, 2010, Comput. Oper. Res..

Punctuality and idleness in just-in-time scheduling

Francis Sourd, F. Sourd, 2005, Eur. J. Oper. Res..

New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling

Francis Sourd, F. Sourd, 2009, INFORMS J. Comput..

Single machine scheduling with forbidden start times

Francis Sourd, Jean-Charles Billaut, F. Sourd, 2009, 4OR.

Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints

Francis Sourd, F. Sourd, 2006, Oper. Res. Lett..

Optimal timing of a sequence of tasks with general completion costs

Francis Sourd, F. Sourd, 2005, Eur. J. Oper. Res..

The complexity of mean flow time scheduling problems with release times

Marek Chrobak, Philippe Baptiste, Francis Sourd, 2006, J. Sched..

Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem

Francis Sourd, Yann Hendel, F. Sourd, 2006, Eur. J. Oper. Res..