Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarFrancis Sourd
Person information
- affiliation: LIP6, Paris
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – today
- 2010
[j36]Thomas Begin, Bruno Baynat, Francis Sourd, Alexandre Brandwajn:
A DFO technique to calibrate queueing models. Computers & OR 37(2): 273-281 (2010)- [j35]Safia Kedad-Sidhoum, Francis Sourd:
Fast neighborhood search for the single machine earliness-tardiness scheduling problem. Computers & OR 37(8): 1464-1471 (2010) - [j34]Francis Sourd:
Lexicographically minimizing axial motions for the Euclidean TSP. J. Comb. Optim. 19(1): 1-15 (2010)
2000 – 2009
- 2009
- [j33]Jean-Charles Billaut, Francis Sourd:
Single machine scheduling with forbidden start times. 4OR 7(1): 37-50 (2009) - [j32]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) - [j31]Nina Runge, Francis Sourd:
A new model for the preemptive earliness-tardiness scheduling problem. Computers & OR 36(7): 2242-2249 (2009) - [j30]J. Meng-Gérard, Philippe Chrétienne, Philippe Baptiste, Francis Sourd:
On maximizing the profit of a satellite launcher: Selecting and scheduling tasks with time windows and setups. Discrete Applied Mathematics 157(17): 3656-3664 (2009) - [j29]Yann Hendel, Nina Runge, Francis Sourd:
The one-machine just-in-time scheduling problem with preemption. Discrete Optimization 6(1): 10-22 (2009) - [j28]Francis Sourd:
New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling. INFORMS Journal on Computing 21(1): 167-175 (2009) - [j27]Philippe Baptiste, Graham Kendall
, Alix Munier, Francis Sourd:
Preface. J. Scheduling 12(6): 563-564 (2009) - 2008
- [j26]Philippe Baptiste, Marta Flamini, Francis Sourd:
Lagrangian bounds for just-in-time job-shop scheduling. Computers & OR 35(3): 906-915 (2008) - [j25]Emmanuel Néron, Fabrice Tercinet, Francis Sourd:
Search tree based approaches for parallel machine scheduling. Computers & OR 35(4): 1127-1137 (2008) - [j24]Yasmin A. Rios-Solis, Francis Sourd:
Exponential neighborhood search for a parallel machine scheduling problem. Computers & OR 35(5): 1697-1712 (2008) - [j23]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) - [j22]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) - [j21]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
- [j20]Yann Hendel, Francis Sourd:
An improved earliness-tardiness timing algorithm. Computers & OR 34(10): 2931-2938 (2007) - [j19]Timothée Bossart, Alix Munier Kordon, Francis Sourd:
Memory management optimization problems for integrated circuit simulators. Discrete Applied Mathematics 155(14): 1795-1811 (2007) - [j18]Nathalie Faure, Philippe Chrétienne, Éric Gourdin, Francis Sourd:
Biclique completion problems for multicast network design. Discrete Optimization 4(3-4): 360-377 (2007) - [j17]Francis Sourd:
Scheduling with periodic availability constraints and irregular cost functions. RAIRO - Operations Research 41(2): 141-154 (2007) - [j16]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) - [i3]Francis Sourd, Marc Schoenauer:
Evolutionary Mesh Numbering: Preliminary Results. CoRR abs/0706.1410 (2007) - 2006
- [j15]Francis Sourd:
Preemptive Scheduling with Position Costs. Algorithmic Operations Research 1(2) (2006) - [j14]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) - [j13]Francis Sourd:
Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints. Oper. Res. Lett. 34(5): 591-598 (2006) - [i2]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) - 2005
- [j12]Francis Sourd:
Earliness-tardiness scheduling with setup considerations. Computers & OR 32: 1849-1865 (2005) - [j11]Francis Sourd:
Optimal timing of a sequence of tasks with general completion costs. European Journal of Operational Research 165(1): 82-96 (2005) - [j10]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) - [j9]Francis Sourd:
Punctuality and idleness in just-in-time scheduling. European Journal of Operational Research 167(3): 739-751 (2005) - 2004
- [j8]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) - [i1]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) - 2003
- [j7]Alix Munier, Francis Sourd:
Scheduling chains on a single machine with non-negative time lags. Math. Meth. of OR 57(1): 111-123 (2003) - [j6]Francis Sourd, Safia Kedad-Sidhoum:
The One-Machine Problem with Earliness and Tardiness Penalties. J. Scheduling 6(6): 533-549 (2003) - [j5]Philippe Chrétienne, Francis Sourd:
PERT scheduling with convex cost functions. Theor. Comput. Sci. 292(1): 145-164 (2003) - 2001
- [j4]Francis Sourd:
Preemptive Scheduling with Two Minimax Criteria. Annals OR 107(1-4): 303-319 (2001) - [j3]Francis Sourd:
Scheduling Tasks on Unrelated Machines: Large Neighborhood Improvement Procedures. J. Heuristics 7(6): 519-531 (2001) - 2000
- [j2]Francis Sourd, Wim Nuijten:
Multiple-Machine Lower Bounds for Shop-Scheduling Problems. INFORMS Journal on Computing 12(4): 341-352 (2000)
1990 – 1999
- 1999
- [j1]Francis Sourd, Philippe Chrétienne:
Fiber-to-object assignment heuristics. European Journal of Operational Research 117(1): 1-14 (1999)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org and opencitations.net to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy.
Citation data
Add a list of citing articles from to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter accout. At the same time, Twitter will persitently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2019-10-02 03:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
