The following pages link to Francis Sourd (Q189401):
Displaying 38 items.
- (Q732889) (redirect page) (← links)
- A DFO technique to calibrate queueing models (Q732891) (← links)
- A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem (Q835579) (← links)
- An improved earliness--tardiness timing algorithm (Q878565) (← links)
- The complexity of mean flow time scheduling problems with release times (Q880590) (← links)
- Search tree based approaches for parallel machine scheduling (Q941538) (← links)
- Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date (Q947941) (← links)
- On maximizing the profit of a satellite launcher: selecting and scheduling tasks with time windows and setups (Q967435) (← links)
- The one-machine just-in-time scheduling problem with preemption (Q1013290) (← links)
- A new model for the preemptive earliness-tardiness scheduling problem (Q1013402) (← links)
- Single machine scheduling with forbidden start times (Q1022436) (← links)
- Scheduling chains on a single machine with non-negative time lags (Q1395149) (← links)
- Preemptive scheduling with two minimax criteria (Q1599352) (← links)
- Continuous filling and emptying of storage systems in constraint-based scheduling (Q1772852) (← links)
- Optimal timing of a sequence of tasks with general completion costs (Q1776957) (← links)
- Earliness-tardiness scheduling with setup considerations (Q1777159) (← links)
- Fiber-to-object assignment heuristics (Q1847144) (← links)
- PERT scheduling with convex cost functions. (Q1853737) (← links)
- Lexicographically minimizing axial motions for the Euclidean TSP (Q2268758) (← links)
- Fast neighborhood search for the single machine earliness-tardiness scheduling problem (Q2379655) (← links)
- Memory management optimization problems for integrated circuit simulators (Q2383536) (← links)
- Biclique completion problems for multicast network design (Q2427696) (← links)
- Lagrangian bounds for just-in-time job-shop scheduling (Q2456651) (← links)
- Exponential neighborhood search for a parallel machine scheduling problem (Q2459402) (← links)
- The one-machine problem with earliness and tardiness penalties (Q2464404) (← links)
- Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints (Q2480060) (← links)
- Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates (Q2482802) (← links)
- Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem (Q2491772) (← links)
- Punctuality and idleness in just-in-time scheduling (Q2566707) (← links)
- Multiple-Machine Lower Bounds for Shop-Scheduling Problems (Q2884494) (← links)
- The Continuous Assignment Problem and Its Application to Preemptive and Non-Preemptive Scheduling with Irregular Cost Functions (Q2890420) (← links)
- A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem (Q2901028) (← links)
- New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling (Q2901056) (← links)
- Scheduling with periodic availability constraints and irregular cost functions (Q3598681) (← links)
- (Q3598877) (← links)
- (Q5755520) (← links)
- Scheduling with tails and deadlines (Q5937434) (← links)
- Scheduling tasks on unrelated machines: large neighborhood improvement procedures (Q5960733) (← links)
