SOURD Francis
Departure date : 05/05/2008
2008
RUNGE Nina : Problèmes d'ordonnancement avance-retard avec et sans préemption .
2007
2006
FAURE Nathalie : Contribution à la résolution de problèmes de regroupement de sessions multicasts .
2005
HENDEL Yann : Contributions Ă l'ordonnancement juste-Ă -temps .
1997-2010 Publications
All
Books
Journal articles
Communications
Thesis
Other publications
2010
S. Kedad‑Sidhoum, F. Sourd : “Fast Neighborhood Search For The Single Machine Earliness-Tardiness Scheduling Problem ”, Computers and Operations Research, vol. 37 (8), pp. 1464-1471, (Elsevier) (2010)
Th. Begin, B. Baynat, F. Sourd, A. Brandwajn : “A DFO technique to calibrate queueing models ”, Computers and Operations Research, vol. 37 (2), pp. 273-281, (Elsevier) (2010)
F. Sourd : “Lexicographically minimizing axial motions for the Euclidean TSP ”, Journal of Combinatorial Optimization, vol. 19 (1), pp. 1-15, (Springer Verlag) (2010)
2009
Ph. Baptiste, Ph. ChrĂ©tienne, J. Meng‑GĂ©rard, F. Sourd : “On maximizing the profit of a satellite launcher: selecting and scheduling tasks with time windows and setups ”, Discrete Applied Mathematics, vol. 157 (17), pp. 3656-3664, (Elsevier) (2009)
N. Runge, F. Sourd : “A new model for the preemptive earliness - tardiness scheduling problem ”, Computers and Operations Research, vol. 36 (7), pp. 2242-2249, (Elsevier) (2009)
J.‑Ch. Billaut, F. Sourd : “Single machine scheduling with forbidden start times ”, 4OR: A Quarterly Journal of Operations Research, vol. 7 (1), pp. 37-50, (Springer Verlag) (2009)
Y. Hendel, N. Runge, F. Sourd : “The one-machine just-in-time scheduling problem with preemption ”, Discrete Optimization, vol. 6 (1), pp. 10-22, (Elsevier) (2009)
C. Sakuraba, D. Ronconi, F. Sourd : “Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date ”, Computers and Operations Research, vol. 36 (1), pp. 60-72, (Elsevier) (2009)
F. Sourd : “New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling ”, INFORMS Journal on Computing, vol. 21 (1), pp. 167-175, (Institute for Operations Research and the Management Sciences (INFORMS)) (2009)
2008
F. Sourd : “Ordonnancer "Juste-Ă -temps" ”, habilitation, phd defence 04/03/2008 (2008)
S. Kedad‑Sidhoum, Y. Rios Solis, F. Sourd : “Lower bound for the earliness-tardiness scheduling problem on parallel machines with distinct due dates ”, European Journal of Operational Research, vol. 189 (3), pp. 1305-1316, (Elsevier) (2008)
F. Sourd, O. Spanjaard : “A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem ”, INFORMS Journal on Computing, vol. 20 (3), pp. 472-484, (Institute for Operations Research and the Management Sciences (INFORMS)) (2008)
Y. Rios Solis, F. Sourd : “Exponential neighborhood search for a parallel machine scheduling problem ”, Computers and Operations Research, vol. 35 (5), pp. 1697-1712, (Elsevier) (2008)
S. Kedad‑Sidhoum, F. Sourd : “Fast neighborhood search for the single machine earliness-tardiness scheduling problem ”, 11th International Workshop on Project Management and Scheduling, Istanbul, Turkey, pp. 164-168 (2008)
Ph. Baptiste, M. Flamini, F. Sourd : “Lagrangian bounds for just-in-time job-shop scheduling ”, Computers and Operations Research, vol. 35 (3), pp. 906-915, (Elsevier) (2008)
F. Sourd, S. Kedad‑Sidhoum : “A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem ”, Journal of Scheduling, vol. 11 (1), pp. 49-58, (Springer Verlag) (2008)
Y. Hendel, F. Sourd : “Job-shop with two jobs and irregular criteria ”, International Journal of Operations Research, vol. 5 (1), pp. 61-67, (Operations Research Society of Taiwan (ORSTW)) (2008)
E. Neron, F. Tercinet, F. Sourd : “Search tree based approaches for parallel machine scheduling ”, Computers and Operations Research, vol. 35 (4), pp. 1127-1137, (Elsevier) (2008)
2007
N. Faure, Ph. ChrĂ©tienne, E. GOURDIN, F. Sourd : “Biclique completion problems for multicast network design ”, Discrete Optimization, vol. 4 (3-4), pp. 360-377, (Elsevier) (2007)
Y. Hendel, F. Sourd : “An improved earliness-tardiness timing algorithm ”, Computers and Operations Research, vol. 34 (10), pp. 2931-2938, (Elsevier) (2007)
T. Bossart, A. Munier‑Kordon, F. Sourd : “Memory Management Optimization Problems for Integrated Circuit Simulators ”, Discrete Applied Mathematics, vol. 155 (14), pp. 1795-1811, (Elsevier) (2007)
Ph. ChrĂ©tienne, F. Sourd : “Selecting and scheduling tasks with agreeable time windows and setup costs ”, Proceedings of the 3rd Multidisciplinary International Conference on Scheduling: Theory and Applications, Paris, France, pp. 561-563 (2007)
F. Sourd : “Scheduling with periodic availability constraints and irregular cost functions ”, RAIRO - Operations Research, vol. 41 (2), pp. 141-154, (EDP Sciences) (2007)
Ph. Baptiste, P. Brucker, M. Chrobak, Ch. DĂĽrr, S. Kravchenko, F. Sourd : “The Complexity of Mean Flow Time Scheduling Problems with Release Times ”, Journal of Scheduling, vol. 10 (2), pp. 139-146, (Springer Verlag) (2007)
N. Runge, F. Sourd : “Problème d’ordonnancement avance-retard autour d’une date d’échĂ©ance commune avec prĂ©emptions ”, ConfĂ©rence scientifique conjointe en Recherche OpĂ©rationnelle et Aide Ă la DĂ©cision FRANCORO V / ROADEF 2007, Grenoble, France, pp. 229-239, (Presses Universitaires de Grenoble) (2007)
S. Kedad‑Sidhoum, F. Sourd, J.‑Y. Zhao : “Voisinages rapides pour le problème d’ordonnancement Ă une machine avec pĂ©nalitĂ©s d’avance et de retard ”, ConfĂ©rence scientifique conjointe en Recherche OpĂ©rationnelle et Aide Ă la DĂ©cision FRANCORO V / ROADEF 2007, Grenoble, France, pp. 259-260, (Presses Universitaires de Grenoble) (2007)
2006
Th. Begin, B. Baynat, A. Brandwajn, S. Fdida, S. Kedad‑Sidhoum, F. Sourd : “GĂ©nĂ©ration automatique de modèles calibrĂ©s. Une mĂ©thodologie complète ”, CFIP 2006 - 12e Colloque Francophone sur l'IngĂ©nierie des Protocoles, Tozeur, Tunisia, pp. 1-12, (Hermès) (2006)
F. Sourd : “Dynasearch neighborhood for the earliness-tardiness scheduling problem with release dates and setup constraints ”, Operations Research Letters, vol. 34 (5), pp. 591-598, (Elsevier) (2006)
Y. Hendel, F. Sourd : “Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem ”, European Journal of Operational Research, vol. 173 (1), pp. 108-119, (Elsevier) (2006)
F. Sourd, O. Spanjaard, P. Perny : “Multi-objective branch and bound. Application to the bi-objective spanning tree problem ”, 7th International Conference in Multi-Objective Programming and Goal Programming, Tours, France (2006)
F. Sourd : “A reinforced Lagrangean relaxation for non-preemptive single machine problem ”, 10th International Workshop on Project Management and Scheduling, Poznan, Poland, pp. 330-334 (2006)
A. Robert, C. Le Pape, F. Sourd : “Lot streaming et pegging pour l’intĂ©gration de la planification et de l’ordonnancement de production ”, 7e Congrès de la SociĂ©tĂ© Française de Recherche OpĂ©rationnelle et d'Aide Ă la DĂ©cision (ROADEF 2006), Lille, France, pp. 273-290, (Presses Universitaires de Valenciennes) (2006)
N. Runge, F. Sourd, Y. Hendel : “Une borne infĂ©rieure pour l’ordonnancement prĂ©emptif Juste-Ă -Temps sur une machine ”, 7e Congrès de la SociĂ©tĂ© Française de Recherche OpĂ©rationnelle et d'Aide Ă la DĂ©cision (ROADEF 2006), Lille, France (2006)
F. Sourd : “Preemptive scheduling with position costs ”, Algorithmic Operations Research, vol. 1 (2), pp. 79-93, (Preeminent Academic Facets) (2006)
2005
F. Sourd : “Punctuality and idleness in just-in-time scheduling ”, European Journal of Operational Research, vol. 167 (3), pp. 739-751, (Elsevier) (2005)
Ph. ChrĂ©tienne, N. Faure, E. GOURDIN, F. Sourd : “Multicast sessions partitioning problem ”, 5th ALIO/EURO conference on combinatorial optimization, Paris, France, pp. 47-47 (2005)
Y. Rios Solis, F. Sourd : “Parallel scheduling problem with irregular cost functions ”, 5th ALIO/EURO conference on combinatorial optimization, Paris, France, pp. 101-101 (2005)
F. Sourd : “Preemptive scheduling around a common due date ”, 5th ALIO/EURO conference on combinatorial optimization, Paris, France, pp. 109-109 (2005)
F. Sourd, J. Rogerie : “Continuous Filling and Emptying of Storage Systems in constraint-Âbased Scheduling ”, European Journal of Operational Research, vol. 165 (2), pp. 510-524, (Elsevier) (2005)
F. Sourd : “Optimal timing of a sequence of tasks with general completion costs ”, European Journal of Operational Research, vol. 165 (1), pp. 82-96, (Elsevier) (2005)
Y. Rios Solis, F. Sourd : “Large neighborhood for a parallel scheduling problem with earliness-tardiness penalties and a common due date ”, Multidisciplinary International Conference on Scheduling: Theory and Applications, New York, United States, pp. 169-184 (2005)
Y. Hendel, F. Sourd : “The single machine just-in-time scheduling problem with preemptions ”, Multidisciplinary International Conference on Scheduling: Theory and Applications, New York, United States, pp. 140-148 (2005)
F. Sourd : “Earliness-tardiness scheduling with setup considerations ”, Computers and Operations Research, vol. 32 (7), pp. 1849-1865, (Elsevier) (2005)
F. Sourd, S. Kedad‑Sidhoum : “A new branch-and-bound algorithm for the minimization of earlinessa nd tardiness on a single machine ”, MAPSP 2005 - 7th workshop on Models and Algorithms for Planning and Scheduling Problems, Siena, Italy, pp. 258-261 (2005)
Ph. Baptiste, M. Chrobak, Ch. DĂĽrr, F. Sourd : “Preemptive Multi-Machine Scheduling of Equal-Length Jobs to Minimize the Average Flow-Time ”, MAPSP 2005 - 7th workshop on Models and Algorithms for Planning and Scheduling Problems, Siena, Italy, pp. 36-38 (2005)
A. Robert, C. Le Pape, F. Paulin, F. Sourd : “Une nouvelle approche de l’intĂ©gration de la planification de production et de l’ordonnancement ”, 7e Rencontre des Jeunes Chercheurs en Intelligence Artificielle, Nice, France, pp. 15-28 (2005)
N. Faure, Ph. ChrĂ©tienne, E. GOURDIN, F. Sourd : “Arbres multicast optimaux dans les rĂ©seaux de tĂ©lĂ©communication ”, 6e Congrès de la SociĂ©tĂ© Française de Recherche OpĂ©rationnelle et d'Aide Ă la DĂ©cision (ROADEF 2005), Tours, France, pp. 313-325, (Presses Universitaires François Rabelais) (2005)
F. Sourd : “Ordonnancement avec pĂ©nalitĂ©s d’avance et de retard et interruptions pĂ©riodiques ”, 6e Congrès de la SociĂ©tĂ© Française de Recherche OpĂ©rationnelle et d'Aide Ă la DĂ©cision (ROADEF 2005), Tours, France, pp. 330-331 (2005)
Y. Rios Solis, F. Sourd : “Voisinage exponentiel pour un problème d’ordonnacement avec des pĂ©nalitĂ©s d’avance-retard autour d’une date d’échĂ©ance commune ”, 6e Congrès de la SociĂ©tĂ© Française de Recherche OpĂ©rationnelle et d'Aide Ă la DĂ©cision (ROADEF 2005), Tours, France, pp. 133-149, (Presses Universitaires François Rabelais) (2005)
2004
F. Tercinet, E. Neron, F. Sourd : “Heuristics based on truncated search trees for the parallel machine problem with release dates and tails ”, PMS 2004 - 9th EURO Working Group on Project Management and Scheduling, Nancy, France, pp. 214-217 (2004)
S. Kedad‑Sidhoum, Y. Rios Solis, F. Sourd : “Lower bounds for the earliness-tardiness scheduling problem on parallel machines ”, PMS 2004 - 9th International Workshop on Project Management and Scheduling, Nancy, France, pp. 210-213 (2004)
Ph. Baptiste, F. Sourd : “The earliness-tardiness job-shop scheduling problem ”, PMS 2004 - 9th EURO Working Group on Project Management and Scheduling, Nancy, France, pp. 246-249 (2004)
Ch. Artigues, Ph. Baptiste, J. Carlier, Ph. ChrĂ©tienne, Ch. GuĂ©ret, C. Hanen, S. Kedad‑Sidhoum, Ch. Lahlou, Ch. LentĂ©, A. Munier‑Kordon, E. Neron, Ch. Picouleau, E. Pinson, M.‑C. Portmann, Ch. Prins, C. Proust, D. Rivreau, F. Sourd : “Modèles et Algorithmes en Ordonnancement: Exercices et Problèmes CorrigĂ©s ”, 227 p pages, (Ellipses), (ISBN: 978-2729821715) (2004)
F. Sourd : “The continuous assignment problem and its application to preemptive and non-preemptive scheduling with irregular cost functions ”, INFORMS Journal of Computing, vol. 16 (2), pp. 198-208 (2004)
2003
F. Sourd, S. Kedad‑Sidhoum : “The one machine scheduling with earliness and tardiness penalties ”, Journal of Scheduling, vol. 6 (6), pp. 533-549, (Springer Verlag) (2003)
Y. Hendel, F. Sourd : “Job-Shop Ă deux tâches avec critères irrĂ©guliers ”, Ecole d'Automne de Recherche OpĂ©rationnelle, Tours, France, pp. 70-73 (2003)
A. Munier‑Kordon, F. Sourd : “Scheduling chains on a single machine with non-negative time lags ”, Mathematical Methods of Operations Research, vol. 57 (1), pp. 111-123, (Springer Verlag) (2003)
F. Sourd : “Preemptive and non-preemptive scheduling with irregular cost functions ”, MAPSP 2003 - 6th workshop on Models and Algorithms for Planning and Scheduling Problems, Aussois, France, pp. 89-90 (2003)
T. Bossart, A. Munier‑Kordon, F. Sourd : “Optimisation de l’utilisation de la mĂ©moire pour un simulateur de circuits ”, 5e Congrès de la SociĂ©tĂ© Française de Recherche OpĂ©rationnelle et d'Aide Ă la DĂ©cision (ROADEF 2003), Avignon, France, pp. 393-394 (2003)
F. Sourd : “Problèmes d’optimisation combinatoire paramĂ©trĂ©s par des fonctions linĂ©aires par morceaux ”, 5e Congrès de la SociĂ©tĂ© Française de Recherche OpĂ©rationnelle et d'Aide Ă la DĂ©cision (ROADEF 2003), Avignon, France, pp. 261-262 (2003)
Ph. ChrĂ©tienne, F. Sourd : “PERT Scheduling with Convex Cost Functions ”, Theoretical Computer Science, vol. 292 (1), pp. 145-164, (Elsevier) (2003)
Y. Hendel, F. Sourd : “Calcul de voisinages pour l’ordonnancement avec critères irrĂ©guliers ”, MOSIM 2003 - confĂ©rence Francophone de ModĂ©lisation et Simulation, Toulouse, France, pp. 21-25, (SCS-European Publishing House) (2003)
2002
F. Sourd : “The continuous assignment problem and its application to preemptive and non-preemptive scheduling with irregular cost functions ”, (2002)
F. Sourd : “Scheduling a sequence of tasks with general completion costs ”, (2002)
F. Sourd, J. Rogerie : “Continuous Filling and Emptying of Storage Systems in Constraint-Based Scheduling ”, 8th International Workshop on Project Management and Scheduling, Valencia, Spain, pp. 342-345 (2002)
F. Sourd : “Scheduling a sequence of tasks with general completion costs ”, CO 2002 - 12th International Symposium on Combinatorial Optimization, Paris, France, pp. 127-127 (2002)
F. Sourd, S. Kedad‑Sidhoum : “Le problème Ă une machine avec pĂ©nalitĂ©s d’avance et de retard ”, 4e Congrès de la SociĂ©tĂ© Française de Recherche OpĂ©rationnelle et d'Aide Ă la DĂ©cision (ROADEF 2002), Paris, France, pp. 177-177 (2002)
F. Sourd : “Minimisation du coĂ»t d’une sĂ©quence de tâches ”, 4e Congrès de la SociĂ©tĂ© Française de Recherche OpĂ©rationnelle et d'Aide Ă la DĂ©cision (ROADEF 2002), Paris, France, pp. 275-276 (2002)
2001
F. Sourd : “Scheduling tasks on unrelated machines: large neighborhood improvement procedures ”, Journal of Heuristics, vol. 7 (6), pp. 519-531, (Springer Verlag) (2001)
F. Sourd : “Preemptive Scheduling with Two Minimax Criteria ”, Annals of Operations Research, vol. 107 (1), pp. 303-319, (Springer Verlag) (2001)
F. Sourd, W. Nuijten : “Scheduling with tails and deadlines ”, Journal of Scheduling, vol. 4 (2), pp. 105-121, (Springer Verlag) (2001)
2000
F. Sourd : “Contributions Ă l’étude et Ă la rĂ©solution de problèmes d’ordonnancement disjonctifs ”, thesis, phd defence 09/18/2000, supervision ChrĂ©tienne, Philippe (2000)
F. Sourd, Ph. ChrĂ©tienne : “Scheduling with convex cost functions ”, 17th International Symposium on Mathematical Programming, Atlanta, GA, United States, pp. 148-148 (2000)
F. Sourd, W. Nuijten : “New time-bound Adjustment Techniques for Shop Scheduling ”, 7th International Workshop on Project Management and Scheduling, OsnabrĂĽck, Germany, pp. 224-226 (2000)
F. Sourd : “Relations de prĂ©cĂ©dences et contraintes disjonctives ”, 3e Congrès de la SociĂ©tĂ© Française de Recherche OpĂ©rationnelle et d'Aide Ă la DĂ©cision (ROADEF 2000), Nantes, France (2000)
F. Sourd, W. Nuijten : “Multiple-machine lower bounds for shop-scheduling problems ”, INFORMS Journal of Computing, vol. 12 (4), pp. 341-352 (2000)
1999
1998
1997