Francis Sourd

From MaRDI portal
Person:189401

Available identifiers

zbMath Open sourd.francisMaRDI QIDQ189401

List of research outcomes





PublicationDate of PublicationType
A multiobjective branch-and-bound framework: application to the biobjective spanning tree problem2012-07-28Paper
New exact algorithms for one-machine earliness-tardiness scheduling2012-07-28Paper
The continuous assignment problem and its application to preemptive and non-preemptive scheduling with irregular cost functions2012-06-08Paper
Multiple-machine lower bounds for shop-scheduling problems2012-05-30Paper
On maximizing the profit of a satellite launcher: selecting and scheduling tasks with time windows and setups2010-04-28Paper
Fast neighborhood search for the single machine earliness-tardiness scheduling problem2010-03-19Paper
Lexicographically minimizing axial motions for the Euclidean TSP2010-03-09Paper
A DFO technique to calibrate queueing models2009-10-15Paper
A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem2009-08-28Paper
Single machine scheduling with forbidden start times2009-06-22Paper
A new model for the preemptive earliness-tardiness scheduling problem2009-04-17Paper
The one-machine just-in-time scheduling problem with preemption2009-04-17Paper
https://portal.mardi4nfdi.de/entity/Q35988772009-02-03Paper
Scheduling with periodic availability constraints and irregular cost functions2009-02-03Paper
Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date2008-10-08Paper
Search tree based approaches for parallel machine scheduling2008-09-01Paper
Biclique completion problems for multicast network design2008-05-14Paper
Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates2008-04-24Paper
Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints2008-03-28Paper
The one-machine problem with earliness and tardiness penalties2007-12-20Paper
Exponential neighborhood search for a parallel machine scheduling problem2007-11-06Paper
Lagrangian bounds for just-in-time job-shop scheduling2007-10-19Paper
Memory management optimization problems for integrated circuit simulators2007-09-19Paper
https://portal.mardi4nfdi.de/entity/Q57555202007-08-13Paper
The complexity of mean flow time scheduling problems with release times2007-05-15Paper
An improved earliness--tardiness timing algorithm2007-04-26Paper
Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem2006-05-29Paper
Punctuality and idleness in just-in-time scheduling2005-09-28Paper
Earliness-tardiness scheduling with setup considerations2005-05-12Paper
Optimal timing of a sequence of tasks with general completion costs2005-05-12Paper
Continuous filling and emptying of storage systems in constraint-based scheduling2005-04-21Paper
Scheduling chains on a single machine with non-negative time lags2003-06-26Paper
PERT scheduling with convex cost functions.2003-01-22Paper
Fiber-to-object assignment heuristics2002-11-17Paper
Preemptive scheduling with two minimax criteria2002-06-09Paper
Scheduling with tails and deadlines2001-07-12Paper
Scheduling tasks on unrelated machines: large neighborhood improvement procedures2001-01-01Paper

Research outcomes over time

This page was built for person: Francis Sourd