Francis Sourd Vis

*	2009
31	EE	Jean-Charles Billaut, Francis Sourd: Single machine scheduling with forbidden start times. 4OR 7(1): 37-50 (2009)
30	EE	Celso S. Sakuraba, Débora P. Ronconi, Francis Sourd: Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date. Computers & OR 36(1): 60-72 (2009)
29	EE	Nina Runge, Francis Sourd: A new model for the preemptive earliness-tardiness scheduling problem. Computers & OR 36(7): 2242-2249 (2009)
28	EE	Yann Hendel, Nina Runge, Francis Sourd: The one-machine just-in-time scheduling problem with preemption. Discrete Optimization 6(1): 10-22 (2009)
27	EE	Francis Sourd: New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling. INFORMS Journal on Computing 21(1): 167-175 (2009)
	2008
26	EE	Philippe Baptiste, Marta Flamini, Francis Sourd: Lagrangian bounds for just-in-time job-shop scheduling. Computers & OR 35(3): 906-915 (2008)
25	EE	Emmanuel Néron, Fabrice Tercinet, Francis Sourd: Search tree based approaches for parallel machine scheduling. Computers & OR 35(4): 1127-1137 (2008)
24	EE	Yasmin A. Rios-Solis, Francis Sourd: Exponential neighborhood search for a parallel machine scheduling problem. Computers & OR 35(5): 1697-1712 (2008)
23	EE	Safia Kedad-Sidhoum, Yasmin A. Rios-Solis, Francis Sourd: Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates. European Journal of Operational Research 189(3): 1305-1316 (2008)
22	EE	Francis Sourd, Olivier Spanjaard: A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem. INFORMS Journal on Computing 20(3): 472-484 (2008)
21	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
20	EE	Francis Sourd, Marc Schoenauer: Evolutionary Mesh Numbering: Preliminary Results CoRR abs/0706.1410: (2007)
19	EE	Yann Hendel, Francis Sourd: An improved earliness-tardiness timing algorithm. Computers & OR 34(10): 2931-2938 (2007)
18	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)
17	EE	Nathalie Faure, Philippe Chrétienne, Éric Gourdin, Francis Sourd: Biclique completion problems for multicast network design. Discrete Optimization 4(3-4): 360-377 (2007)
16	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
15	EE	Francis Sourd: Preemptive Scheduling with Position Costs. Algorithmic Operations Research 1(2): (2006)
14	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)
13	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)
12	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
11	EE	Francis Sourd: Earliness-tardiness scheduling with setup considerations. Computers & OR 32: 1849-1865 (2005)
10	EE	Francis Sourd: Optimal timing of a sequence of tasks with general completion costs. European Journal of Operational Research 165(1): 82-96 (2005)
9	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)
8	EE	Francis Sourd: Punctuality and idleness in just-in-time scheduling. European Journal of Operational Research 167(3): 739-751 (2005)
	2004
7	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)
6	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
5		Francis Sourd, Safia Kedad-Sidhoum: The One-Machine Problem with Earliness and Tardiness Penalties. J. Scheduling 6(6): 533-549 (2003)
4		Philippe Chrétienne, Francis Sourd: PERT scheduling with convex cost functions. Theor. Comput. Sci. 292(1): 145-164 (2003)
	2001
3	EE	Francis Sourd: Preemptive Scheduling with Two Minimax Criteria. Annals OR 107(1-4): 303-319 (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)

Coauthor Index

1	Philippe Baptiste	[7] [14] [16] [26]
2	Jean-Charles Billaut	[31]
3	Timothée Bossart	[18]
4	Peter Brucker	[14] [16]
5	Philippe Chrétienne	[4] [17]
6	Marek Chrobak	[7] [14] [16]
7	Christoph Dürr	[7] [14] [16]
8	Nathalie Faure	[17]
9	Marta Flamini	[26]
10	Éric Gourdin	[17]
11	Yann Hendel	[13] [19] [28]
12	Safia Kedad-Sidhoum	[5] [21] [23]
13	Alix Munier Kordon (Alix Munier)	[18]
14	Svetlana A. Kravchenko	[14] [16]
15	Emmanuel Néron	[25]
16	Wim Nuijten (W. P. M. Nuijten)	[1]
17	Yasmin A. Rios-Solis	[23] [24]
18	Jerome Rogerie	[9]
19	Débora P. Ronconi	[30]
20	Nina Runge	[28] [29]
21	Celso S. Sakuraba	[30]
22	Marc Schoenauer	[20]
23	Olivier Spanjaard	[22]
24	Fabrice Tercinet	[25]

Colors in the list of coauthors