| 2008 |
| 21 | EE | Philippe Baptiste,
Marta Flamini,
Francis Sourd:
Lagrangian bounds for just-in-time job-shop scheduling.
Computers & OR 35(3): 906-915 (2008) |
| 20 | EE | Emmanuel Néron,
Fabrice Tercinet,
Francis Sourd:
Search tree based approaches for parallel machine scheduling.
Computers & OR 35(4): 1127-1137 (2008) |
| 19 | EE | Francis Sourd,
Safia Kedad-Sidhoum:
A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem.
J. Scheduling 11(1): 49-58 (2008) |
| 2007 |
| 18 | EE | Francis Sourd,
Marc Schoenauer:
Evolutionary Mesh Numbering: Preliminary Results
CoRR abs/0706.1410: (2007) |
| 17 | EE | Yann Hendel,
Francis Sourd:
An improved earliness-tardiness timing algorithm.
Computers & OR 34(10): 2931-2938 (2007) |
| 16 | EE | Timothée Bossart,
Alix Munier Kordon,
Francis Sourd:
Memory management optimization problems for integrated circuit simulators.
Discrete Applied Mathematics 155(14): 1795-1811 (2007) |
| 15 | EE | 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. Scheduling 10(2): 139-146 (2007) |
| 2006 |
| 14 | EE | Francis Sourd:
Preemptive Scheduling with Position Costs.
Algorithmic Operations Research 1(2): (2006) |
| 13 | EE | 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 abs/cs/0605078: (2006) |
| 12 | EE | Yann Hendel,
Francis Sourd:
Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem.
European Journal of Operational Research 173(1): 108-119 (2006) |
| 11 | EE | Francis Sourd:
Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints.
Oper. Res. Lett. 34(5): 591-598 (2006) |
| 2005 |
| 10 | EE | Francis Sourd:
Earliness-tardiness scheduling with setup considerations.
Computers & OR 32: 1849-1865 (2005) |
| 9 | EE | Francis Sourd:
Optimal timing of a sequence of tasks with general completion costs.
European Journal of Operational Research 165(1): 82-96 (2005) |
| 8 | EE | Francis Sourd,
Jerome Rogerie:
Continuous filling and emptying of storage systems in constraint-based scheduling.
European Journal of Operational Research 165(2): 510-524 (2005) |
| 7 | EE | Francis Sourd:
Punctuality and idleness in just-in-time scheduling.
European Journal of Operational Research 167(3): 739-751 (2005) |
| 2004 |
| 6 | EE | Philippe Baptiste,
Marek Chrobak,
Christoph Dürr,
Francis Sourd:
Preemptive Multi-Machine Scheduling of Equal-Length Jobs to Minimize the Average Flow Time
CoRR abs/cs/0412094: (2004) |
| 5 | EE | Francis Sourd:
The Continuous Assignment Problem and Its Application to Preemptive and Non-Preemptive Scheduling with Irregular Cost Functions.
INFORMS Journal on Computing 16(2): 198-208 (2004) |
| 2003 |
| 4 | | Francis Sourd,
Safia Kedad-Sidhoum:
The One-Machine Problem with Earliness and Tardiness Penalties.
J. Scheduling 6(6): 533-549 (2003) |
| 3 | | Philippe Chrétienne,
Francis Sourd:
PERT scheduling with convex cost functions.
Theor. Comput. Sci. 292(1): 145-164 (2003) |
| 2001 |
| 2 | | Francis Sourd:
Scheduling Tasks on Unrelated Machines: Large Neighborhood Improvement Procedures.
J. Heuristics 7(6): 519-531 (2001) |
| 2000 |
| 1 | EE | Francis Sourd,
Wim Nuijten:
Multiple-Machine Lower Bounds for Shop-Scheduling Problems.
INFORMS Journal on Computing 12(4): 341-352 (2000) |