Francis Sourd
Francis Sourd
Sun'R Smart Energy
Dirección de correo verificada de sunr-sme.fr
Título
Citado por
Citado por
Año
The one-machine problem with earliness and tardiness penalties
F Sourd, S Kedad-Sidhoum
Journal of scheduling 6 (6), 533-549, 2003
1142003
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
1132008
Earliness–tardiness scheduling with setup considerations
F Sourd
Computers & operations research 32 (7), 1849-1865, 2005
792005
Lagrangian bounds for just-in-time job-shop scheduling
P Baptiste, M Flamini, F Sourd
Computers & Operations Research 35 (3), 906-915, 2008
752008
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
74*2008
New exact algorithms for one-machine earliness-tardiness scheduling
F Sourd
INFORMS Journal on Computing 21 (1), 167-175, 2009
622009
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
612008
PERT scheduling with convex cost functions
P Chrétienne, F Sourd
Theoretical Computer Science 292 (1), 145-164, 2003
592003
Dynasearch for the earliness–tardiness scheduling problem with release dates and setup constraints
F Sourd
Operations Research Letters 34 (5), 591-598, 2006
522006
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
512006
An improved earliness–tardiness timing algorithm
Y Hendel, F Sourd
Computers & operations research 34 (10), 2931-2938, 2007
502007
Optimal timing of a sequence of tasks with general completion costs
F Sourd
European Journal of Operational Research 165 (1), 82-96, 2005
462005
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
342007
The one-machine just-in-time scheduling problem with preemption
Y Hendel, N Runge, F Sourd
Discrete Optimization 6 (1), 10-22, 2009
332009
Modeles et algorithmes en ordonnancement
G GOThA, C Picouleau
322004
Scheduling tasks on unrelated machines: large neighborhood improvement procedures
F Sourd
Journal of Heuristics 7 (6), 519-531, 2001
322001
Fast neighborhood search for the single machine earliness–tardiness scheduling problem
S Kedad-Sidhoum, F Sourd
Computers & Operations Research 37 (8), 1464-1471, 2010
312010
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
312009
Exponential neighborhood search for a parallel machine scheduling problem
YA Rios-Solis, F Sourd
Computers & Operations Research 35 (5), 1697-1712, 2008
282008
The continuous assignment problem and its application to preemptive and non-preemptive scheduling with irregular cost functions
F Sourd
INFORMS Journal on Computing 16 (2), 198-208, 2004
262004
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20