Follow
Francis Sourd
Francis Sourd
Sun'R Smart Energy
Verified email at sunr-sme.fr
Title
Cited by
Cited by
Year
A multiobjective branch-and-bound framework: Application to the biobjective spanning tree problem
F Sourd, O Spanjaard
INFORMS Journal on Computing 20 (3), 472-484, 2008
1432008
The one-machine problem with earliness and tardiness penalties
F Sourd, S Kedad-Sidhoum
Journal of scheduling 6 (6), 533-549, 2003
1222003
Increasing the total productivity of a land by combining mobile photovoltaic panels and food crops
B Valle, T Simonneau, F Sourd, P Pechier, P Hamard, T Frisson, ...
Applied energy 206, 1495-1507, 2017
1082017
Lagrangian bounds for just-in-time job-shop scheduling
P Baptiste, M Flamini, F Sourd
Computers & Operations Research 35 (3), 906-915, 2008
922008
Earliness–tardiness scheduling with setup considerations
F Sourd
Computers & operations research 32 (7), 1849-1865, 2005
852005
A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
F Sourd, S Kedad-Sidhoum
Journal of Scheduling 11 (1), 49-58, 2008
80*2008
New exact algorithms for one-machine earliness-tardiness scheduling
F Sourd
INFORMS Journal on Computing 21 (1), 167-175, 2009
762009
Lower bounds for the earliness–tardiness scheduling problem on parallel machines with distinct due dates
S Kedad-Sidhoum, YR Solis, F Sourd
European Journal of Operational Research 189 (3), 1305-1316, 2008
742008
PERT scheduling with convex cost functions
P Chrétienne, F Sourd
Theoretical Computer Science 292 (1), 145-164, 2003
632003
Dynasearch for the earliness–tardiness scheduling problem with release dates and setup constraints
F Sourd
Operations Research Letters 34 (5), 591-598, 2006
582006
An improved earliness–tardiness timing algorithm
Y Hendel, F Sourd
Computers & operations research 34 (10), 2931-2938, 2007
562007
Efficient neighborhood search for the one-machine earliness–tardiness scheduling problem
Y Hendel, F Sourd
European Journal of Operational Research 173 (1), 108-119, 2006
542006
Optimal timing of a sequence of tasks with general completion costs
F Sourd
European Journal of Operational Research 165 (1), 82-96, 2005
442005
The one-machine just-in-time scheduling problem with preemption
Y Hendel, N Runge, F Sourd
Discrete Optimization 6 (1), 10-22, 2009
432009
PYM: a new, affordable, image-based method using a Raspberry Pi to phenotype plant leaf area in a wide diversity of environments
B Valle, T Simonneau, R Boulord, F Sourd, T Frisson, M Ryckewaert, ...
Plant Methods 13 (1), 1-17, 2017
372017
The complexity of mean flow time scheduling problems with release times
P Baptiste, P Brucker, M Chrobak, C Dürr, SA Kravchenko, F Sourd
Journal of Scheduling 10 (2), 139-146, 2007
372007
Biclique completion problems for multicast network design
N Faure, P Chrétienne, E Gourdin, F Sourd
Discrete Optimization 4 (3-4), 360-377, 2007
362007
Scheduling tasks on unrelated machines: Large neighborhood improvement procedures
F Sourd
Journal of Heuristics 7 (6), 519-531, 2001
352001
Fast neighborhood search for the single machine earliness–tardiness scheduling problem
S Kedad-Sidhoum, F Sourd
Computers & Operations Research 37 (8), 1464-1471, 2010
342010
Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date
CS Sakuraba, DP Ronconi, F Sourd
Computers & Operations Research 36 (1), 60-72, 2009
332009
The system can't perform the operation now. Try again later.
Articles 1–20