Francis Sourd

From MaRDI portal
(Redirected from Person:189401)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
A multiobjective branch-and-bound framework: application to the biobjective spanning tree problem
INFORMS Journal on Computing
2012-07-28Paper
New exact algorithms for one-machine earliness-tardiness scheduling
INFORMS Journal on Computing
2012-07-28Paper
The continuous assignment problem and its application to preemptive and non-preemptive scheduling with irregular cost functions
INFORMS Journal on Computing
2012-06-08Paper
Multiple-machine lower bounds for shop-scheduling problems
INFORMS Journal on Computing
2012-05-30Paper
On maximizing the profit of a satellite launcher: selecting and scheduling tasks with time windows and setups
Discrete Applied Mathematics
2010-04-28Paper
Fast neighborhood search for the single machine earliness-tardiness scheduling problem
Computers & Operations Research
2010-03-19Paper
Lexicographically minimizing axial motions for the Euclidean TSP
Journal of Combinatorial Optimization
2010-03-09Paper
A DFO technique to calibrate queueing models
Computers & Operations Research
2009-10-15Paper
A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
Journal of Scheduling
2009-08-28Paper
Single machine scheduling with forbidden start times
4OR
2009-06-22Paper
A new model for the preemptive earliness-tardiness scheduling problem
Computers & Operations Research
2009-04-17Paper
The one-machine just-in-time scheduling problem with preemption
Discrete Optimization
2009-04-17Paper
Job-shop with two jobs and irregular criteria2009-02-03Paper
Scheduling with periodic availability constraints and irregular cost functions
RAIRO - Operations Research
2009-02-03Paper
Scheduling with periodic availability constraints and irregular cost functions
RAIRO - Operations Research
2009-02-03Paper
Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date
Computers & Operations Research
2008-10-08Paper
Search tree based approaches for parallel machine scheduling
Computers & Operations Research
2008-09-01Paper
Biclique completion problems for multicast network design
Discrete Optimization
2008-05-14Paper
Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates
European Journal of Operational Research
2008-04-24Paper
Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints
Operations Research Letters
2008-03-28Paper
The one-machine problem with earliness and tardiness penalties
Journal of Scheduling
2007-12-20Paper
Exponential neighborhood search for a parallel machine scheduling problem
Computers & Operations Research
2007-11-06Paper
Lagrangian bounds for just-in-time job-shop scheduling
Computers & Operations Research
2007-10-19Paper
Memory management optimization problems for integrated circuit simulators
Discrete Applied Mathematics
2007-09-19Paper
Preemptive scheduling with position costs2007-08-13Paper
The complexity of mean flow time scheduling problems with release times
Journal of Scheduling
2007-05-15Paper
An improved earliness--tardiness timing algorithm
Computers & Operations Research
2007-04-26Paper
Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem
European Journal of Operational Research
2006-05-29Paper
Punctuality and idleness in just-in-time scheduling
European Journal of Operational Research
2005-09-28Paper
Earliness-tardiness scheduling with setup considerations
Computers & Operations Research
2005-05-12Paper
Optimal timing of a sequence of tasks with general completion costs
European Journal of Operational Research
2005-05-12Paper
Continuous filling and emptying of storage systems in constraint-based scheduling
European Journal of Operational Research
2005-04-21Paper
Scheduling chains on a single machine with non-negative time lags
Mathematical Methods of Operations Research
2003-06-26Paper
PERT scheduling with convex cost functions.
Theoretical Computer Science
2003-01-22Paper
Fiber-to-object assignment heuristics
European Journal of Operational Research
2002-11-17Paper
Preemptive scheduling with two minimax criteria
Annals of Operations Research
2002-06-09Paper
Scheduling with tails and deadlines
Journal of Scheduling
2001-07-12Paper
Scheduling tasks on unrelated machines: large neighborhood improvement procedures
Journal of Heuristics
2001-01-01Paper


Research outcomes over time


This page was built for person: Francis Sourd