The following pages link to Philippe Chrétienne (Q496703):
Displaying 45 items.
- The location-dispatching problem: polyhedral results and content delivery network design (Q496706) (← links)
- A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints (Q582203) (← links)
- (Q806664) (redirect page) (← links)
- The basic cyclic scheduling problem with deadlines (Q806665) (← links)
- Reactive and proactive single-machine scheduling to maintain a maximum number of starting times (Q829172) (← links)
- On single-machine scheduling without intermediate delays (Q955319) (← links)
- On maximizing the profit of a satellite launcher: selecting and scheduling tasks with time windows and setups (Q967435) (← links)
- Task scheduling with interprocessor communication delays (Q1197669) (← links)
- List schedules for cyclic scheduling (Q1293196) (← links)
- Tree scheduling with communication delays (Q1327224) (← links)
- (Q1575598) (redirect page) (← links)
- On Graham's bound for cyclic scheduling (Q1575599) (← links)
- A polynomial algorithm for the homogeneously non-idling scheduling problem of unit-time independent jobs on identical parallel machines (Q1752453) (← links)
- Anchored reactive and proactive solutions to the CPM-scheduling problem (Q1753557) (← links)
- Fiber-to-object assignment heuristics (Q1847144) (← links)
- A cutting plane algorithm for the unrelated parallel machine scheduling problem (Q1847208) (← links)
- PERT scheduling with convex cost functions. (Q1853737) (← links)
- Anchored rescheduling problems under generalized precedence constraints (Q2225060) (← links)
- Dominance-based linear formulation for the anchor-robust project scheduling problem (Q2239841) (← links)
- Maximizing the number of jobs scheduled at their baseline starting times in case of machine failures (Q2305019) (← links)
- A polynomial algorithm for the two-connections variant of the tree \(p\)-median problem (Q2339828) (← links)
- Biclique completion problems for multicast network design (Q2427696) (← links)
- Integrated batch sizing and scheduling on a single machine (Q2434256) (← links)
- Homogeneously non-idling schedules of unit-time jobs on identical parallel machines (Q2446341) (← links)
- Une méthode tabou pour l'ordonnancement multiprocesseur avec délais de communication (Q2713147) (← links)
- Minimizing the Earliness and Tardiness Cost of a Sequence of Tasks on a Single Machine (Q2773167) (← links)
- (Q2861504) (← links)
- (Q3059309) (← links)
- (Q3219770) (← links)
- Chemins extrémaux d'un graphe doublement valué (Q3343804) (← links)
- (Q3675537) (← links)
- (Q3696527) (← links)
- (Q3820002) (← links)
- (Q3870653) (← links)
- (Q3888825) (← links)
- Un domaine très ouvert : les problèmes d'ordonnancement (Q3958257) (← links)
- C.P.M. Scheduling with Small Communication Delays and Task Duplication (Q3980521) (← links)
- (Q4045423) (← links)
- (Q4053379) (← links)
- Network sharing by two mobile operators: beyond competition, cooperation (Q5501880) (← links)
- On scheduling with the non-idling constraint (Q5895181) (← links)
- On scheduling with the non-idling constraint (Q5925167) (← links)
- The Anchor-Robust Project Scheduling Problem (Q6196761) (← links)
- Resource leveling: complexity of a unit execution time two-processor scheduling variant and related problems (Q6657887) (← links)
- Anchor-robust project scheduling with non-availability periods (Q6670507) (← links)
