Francis Sourd - RankMe

39 papers Journal 39

Year	Rank	Type	Title / Venue / Authors
2010	J	`jnl`	A DFO technique to calibrate queueing models. Comput. Oper. Res. Thomas Begin, Bruno Baynat, Francis Sourd, Alexandre Brandwajn
2010	J	`jnl`	Fast neighborhood search for the single machine earliness-tardiness scheduling problem. Comput. Oper. Res. Safia Kedad-Sidhoum, Francis Sourd
2010	J	`jnl`	Lexicographically minimizing axial motions for the Euclidean TSP. J. Comb. Optim. Francis Sourd
2009	J	`jnl`	A new model for the preemptive earliness-tardiness scheduling problem. Comput. Oper. Res. Nina Runge, Francis Sourd
2009	J	`jnl`	New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling. INFORMS J. Comput. Francis Sourd
2009	J	`jnl`	On maximizing the profit of a satellite launcher: Selecting and scheduling tasks with time windows and setups. Discret. Appl. Math. J. Meng-Gérard, Philippe Chrétienne, Philippe Baptiste, Francis Sourd
2009	J	`jnl`	Preface. J. Sched. Philippe Baptiste, Graham Kendall, Alix Munier, Francis Sourd
2009	J	`jnl`	Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date. Comput. Oper. Res. Celso S. Sakuraba, Débora P. Ronconi, Francis Sourd
2009	J	`jnl`	Single machine scheduling with forbidden start times. 4OR Jean-Charles Billaut, Francis Sourd
2009	J	`jnl`	The one-machine just-in-time scheduling problem with preemption. Discret. Optim. Yann Hendel, Nina Runge, Francis Sourd
2008	J	`jnl`	A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem. INFORMS J. Comput. Francis Sourd, Olivier Spanjaard
2008	J	`jnl`	A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem. J. Sched. Francis Sourd, Safia Kedad-Sidhoum
2008	J	`jnl`	Exponential neighborhood search for a parallel machine scheduling problem. Comput. Oper. Res. Yasmín Á. Ríos-Solís, Francis Sourd
2008	J	`jnl`	Lagrangian bounds for just-in-time job-shop scheduling. Comput. Oper. Res. Philippe Baptiste, Marta Flamini, Francis Sourd
2008	J	`jnl`	Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates. Eur. J. Oper. Res. Safia Kedad-Sidhoum, Yasmín Á. Ríos-Solís, Francis Sourd
2008	J	`jnl`	Search tree based approaches for parallel machine scheduling. Comput. Oper. Res. Emmanuel Néron, Fabrice Tercinet, Francis Sourd
2007	J	`jnl`	An improved earliness-tardiness timing algorithm. Comput. Oper. Res. Yann Hendel, Francis Sourd
2007	J	`jnl`	Biclique completion problems for multicast network design. Discret. Optim. Nathalie Faure, Philippe Chrétienne, Éric Gourdin, Francis Sourd
2007	J	`jnl`	Evolutionary Mesh Numbering: Preliminary Results CoRR Francis Sourd, Marc Schoenauer
2007	J	`jnl`	Memory management optimization problems for integrated circuit simulators. Discret. Appl. Math. Timothée Bossart, Alix Munier Kordon, Francis Sourd
2007	J	`jnl`	Scheduling with periodic availability constraints and irregular cost functions. RAIRO Oper. Res. Francis Sourd
2007	J	`jnl`	The complexity of mean flow time scheduling problems with release times. J. Sched. Philippe Baptiste, Peter Brucker, Marek Chrobak, Christoph Dürr, Svetlana A. Kravchenko, Francis Sourd
2006	J	`jnl`	Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints. Oper. Res. Lett. Francis Sourd
2006	J	`jnl`	Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem. Eur. J. Oper. Res. Yann Hendel, Francis Sourd
2006	J	`jnl`	Preemptive Scheduling with Position Costs. Algorithmic Oper. Res. Francis Sourd
2006	J	`jnl`	The Complexity of Mean Flow Time Scheduling Problems with Release Times CoRR Philippe Baptiste, Peter Brucker, Marek Chrobak, Christoph Dürr, Svetlana A. Kravchenko, Francis Sourd
2005	J	`jnl`	Continuous filling and emptying of storage systems in constraint-based scheduling. Eur. J. Oper. Res. Francis Sourd, Jerome Rogerie
2005	J	`jnl`	Earliness-tardiness scheduling with setup considerations. Comput. Oper. Res. Francis Sourd
2005	J	`jnl`	Optimal timing of a sequence of tasks with general completion costs. Eur. J. Oper. Res. Francis Sourd
2005	J	`jnl`	Punctuality and idleness in just-in-time scheduling. Eur. J. Oper. Res. Francis Sourd
2004	J	`jnl`	Preemptive Multi-Machine Scheduling of Equal-Length Jobs to Minimize the Average Flow Time CoRR Philippe Baptiste, Marek Chrobak, Christoph Dürr, Francis Sourd
2004	J	`jnl`	The Continuous Assignment Problem and Its Application to Preemptive and Non-Preemptive Scheduling with Irregular Cost Functions. INFORMS J. Comput. Francis Sourd
2003	J	`jnl`	PERT scheduling with convex cost functions. Theor. Comput. Sci. Philippe Chrétienne, Francis Sourd
2003	J	`jnl`	Scheduling chains on a single machine with non-negative time lags. Math. Methods Oper. Res. Alix Munier, Francis Sourd
2003	J	`jnl`	The One-Machine Problem with Earliness and Tardiness Penalties. J. Sched. Francis Sourd, Safia Kedad-Sidhoum
2001	J	`jnl`	Preemptive Scheduling with Two Minimax Criteria. Ann. Oper. Res. Francis Sourd
2001	J	`jnl`	Scheduling Tasks on Unrelated Machines: Large Neighborhood Improvement Procedures. J. Heuristics Francis Sourd
2000	J	`jnl`	Multiple-Machine Lower Bounds for Shop-Scheduling Problems. INFORMS J. Comput. Francis Sourd, Wim Nuijten
1999	J	`jnl`	Fiber-to-object assignment heuristics. Eur. J. Oper. Res. Francis Sourd, Philippe Chrétienne