Search the dblp DataBase

Publications of Author

1. Francis Sourd
   Earliness-tardiness scheduling with setup considerations. [Citation Graph (0, 0)][DBLP]
   Computers & OR, 2005, v:32, n:, pp:1849-1865 [Journal]
   
2. Francis Sourd
   Scheduling Tasks on Unrelated Machines: Large Neighborhood Improvement Procedures. [Citation Graph (0, 0)][DBLP]
   J. Heuristics, 2001, v:7, n:6, pp:519-531 [Journal]
   
3. Francis Sourd
   The Continuous Assignment Problem and Its Application to Preemptive and Non-Preemptive Scheduling with Irregular Cost Functions. [Citation Graph (0, 0)][DBLP]
   INFORMS Journal on Computing, 2004, v:16, n:2, pp:198-208 [Journal]
   
4. Francis Sourd, Wim Nuijten
   Multiple-Machine Lower Bounds for Shop-Scheduling Problems. [Citation Graph (0, 0)][DBLP]
   INFORMS Journal on Computing, 2000, v:12, n:4, pp:341-352 [Journal]
   
5. Francis Sourd
   Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2006, v:34, n:5, pp:591-598 [Journal]
   
6. Francis Sourd, Safia Kedad-Sidhoum
   The One-Machine Problem with Earliness and Tardiness Penalties. [Citation Graph (0, 0)][DBLP]
   J. Scheduling, 2003, v:6, n:6, pp:533-549 [Journal]
   
7. 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. [Citation Graph (0, 0)][DBLP]
   J. Scheduling, 2007, v:10, n:2, pp:139-146 [Journal]
   
8. Philippe Chrétienne, Francis Sourd
   PERT scheduling with convex cost functions. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:292, n:1, pp:145-164 [Journal]
   
9. Yann Hendel, Francis Sourd
   Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem. [Citation Graph (0, 0)][DBLP]
   European Journal of Operational Research, 2006, v:173, n:1, pp:108-119 [Journal]
   
10. Francis Sourd, Jerome Rogerie
    Continuous filling and emptying of storage systems in constraint-based scheduling. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2005, v:165, n:2, pp:510-524 [Journal]
    
11. Francis Sourd
    Optimal timing of a sequence of tasks with general completion costs. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2005, v:165, n:1, pp:82-96 [Journal]
    
12. Francis Sourd
    Punctuality and idleness in just-in-time scheduling. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2005, v:167, n:3, pp:739-751 [Journal]
    
13. Francis Sourd
    Preemptive Scheduling with Position Costs. [Citation Graph (0, 0)][DBLP]
    Algorithmic Operations Research, 2006, v:1, n:2, pp:- [Journal]
    
14. Francis Sourd, Marc Schoenauer
    Evolutionary Mesh Numbering: Preliminary Results [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
    
15. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
    
16. Philippe Baptiste, Marek Chrobak, Christoph Dürr, Francis Sourd
    Preemptive Multi-Machine Scheduling of Equal-Length Jobs to Minimize the Average Flow Time [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
    
17. Timothée Bossart, Alix Munier Kordon, Francis Sourd
    Memory management optimization problems for integrated circuit simulators. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:14, pp:1795-1811 [Journal]
    
18. 
    Single machine scheduling with forbidden start times. [Citation Graph (, )][DBLP]
    
    
19. 
    Exponential neighborhood search for a parallel machine scheduling problem. [Citation Graph (, )][DBLP]
    
    
20. 
    An improved earliness-tardiness timing algorithm. [Citation Graph (, )][DBLP]
    
    
21. 
    Lagrangian bounds for just-in-time job-shop scheduling. [Citation Graph (, )][DBLP]
    
    
22. 
    Search tree based approaches for parallel machine scheduling. [Citation Graph (, )][DBLP]
    
    
23. 
    A new model for the preemptive earliness-tardiness scheduling problem. [Citation Graph (, )][DBLP]
    
    
24. 
    Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date. [Citation Graph (, )][DBLP]
    
    
25. 
    A DFO technique to calibrate queueing models. [Citation Graph (, )][DBLP]
    
    
26. 
    Fast neighborhood search for the single machine earliness-tardiness scheduling problem. [Citation Graph (, )][DBLP]
    
    
27. 
    On maximizing the profit of a satellite launcher: Selecting and scheduling tasks with time windows and setups. [Citation Graph (, )][DBLP]