Sourd Francis

Francis Sourd

Information about the author Francis Sourd will soon be added to the site.
Found 24 papers in total
Fast neighborhood search for the single machine earliness–tardiness scheduling problem
Fast neighborhood search for the single machine earliness–tardiness scheduling problem
2010
This paper addresses the one machine scheduling problem in which n jobs have distinct...
Lexicographically minimizing axial motions for the Euclidean TSP
Lexicographically minimizing axial motions for the Euclidean TSP
2010
A variant of the Euclidean traveling salesman problem (TSP) is defined and studied. In...
A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem
A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem
2008
This paper focuses on a multiobjective derivation of branch–and–bound...
New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling
New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling
2009
In one–machine scheduling, mixed–integer program time–indexed...
Lagrangian bounds for just-in-time job-shop scheduling
Lagrangian bounds for just-in-time job-shop scheduling
2008
We study the job-shop scheduling problem with earliness and tardiness penalties. We...
Search tree based approaches for parallel machine scheduling
Search tree based approaches for parallel machine scheduling
2008
This article compares two branching schemes for the parallel machine scheduling...
A faster branch-and-bound algorithm for the earliness–tardiness scheduling problem
A faster branch-and-bound algorithm for the earliness–tardiness scheduling problem
2008
This paper addresses the one-machine scheduling problem with earliness–tardiness...
Efficient neighborhood search for the one-machine earliness–tardiness scheduling problem
Efficient neighborhood search for the one-machine earliness–tardiness scheduling problem
2006
This paper addresses the one-machine scheduling problem where the objective is to...
An improved earliness–tardiness timing algorithm
An improved earliness–tardiness timing algorithm
2007
Earliness–tardiness criteria with distinct due dates usually induce NP-complete...
The complexity of mean flow time scheduling problems with release times
The complexity of mean flow time scheduling problems with release times
2007
We study the problem of preemptive scheduling of n jobs with given release times on m...
Scheduling with periodic availability constraints and irregular cost functions
Scheduling with periodic availability constraints and irregular cost functions
2007
This paper addresses a one-machine scheduling problem in which the efficiency of the...
The one-machine problem with earliness and tardiness penalties
The one-machine problem with earliness and tardiness penalties
2003
We address the one-machine problem in which the jobs have distinct due dates,...
Preemptive scheduling with position costs
Preemptive scheduling with position costs
2006
This paper is devoted to basic scheduling problems in which the scheduling cost of a...
Dynasearch for the earliness–tardiness scheduling problem with release dates and setup constraints
Dynasearch for the earliness–tardiness scheduling problem with release dates and setup constraints
2006
A large dynasearch neighborhood is introduced for the one-machine scheduling problem...
The continuous assignment problem and its application to preemptive and non-preemptive scheduling with irregular cost functions
The continuous assignment problem and its application to preemptive and non-preemptive scheduling with irregular cost functions
2004
This paper focuses on the continuous assignment problem with the eventual aim to solve...
Punctuality and idleness in just-in-time scheduling
Punctuality and idleness in just-in-time scheduling
2005
In scheduling problems with irregular cost functions, such as deviation functions in...
Continuous filling and emptying of storage systems in constraint-based scheduling
Continuous filling and emptying of storage systems in constraint-based scheduling
2005
In constraint-based scheduling, storage systems are modeled by a class of resources...
Optimal timing of a sequence of tasks with general completion costs
Optimal timing of a sequence of tasks with general completion costs
2005
Scheduling a sequence of tasks – in the acceptation of finding the execution...
Earliness–tardiness scheduling with setup considerations
Earliness–tardiness scheduling with setup considerations
2005
The one-machine scheduling problem with sequence-dependent setup times and costs and...
Preemptive scheduling with two minimax criteria
Preemptive scheduling with two minimax criteria
2001
Two preemptive single-machine bicriteria scheduling problems with release dates and...
Scheduling tasks on unrelated machines: Large neighborhood improvement procedures
Scheduling tasks on unrelated machines: Large neighborhood improvement procedures
2001
Two approximation algorithms are presented for minimizing the makespan of independent...
Scheduling with tails and deadlines
Scheduling with tails and deadlines
2001
This paper discusses scheduling problems that combine tails and deadlines or,...
Multiple-machine lower bounds for shop-scheduling problems
Multiple-machine lower bounds for shop-scheduling problems
2000
In order to compute lower bounds for shop scheduling problems, a lot of attention has...
Fiber-to-object assignment heuristics
Fiber-to-object assignment heuristics
1999
Fiber-to-Object Assignment Problem comes from Astronomy. This geometrical and...
Papers per page: