The following pages link to Jacques Carlier (Q319365):
Displaying 50 items.
- The data transfer problem in a system of systems (Q319366) (← links)
- A preemptive bound for the resource constrained project scheduling problem (Q398922) (← links)
- Dominance rules in combinatorial optimization problems (Q421551) (← links)
- A GRASP metaheuristic for the robust mapping and routing of dataflow process networks on manycore architectures (Q496107) (← links)
- The robust binomial approach to chance-constrained optimization problems with application to stochastic partitioning of large process networks (Q518934) (← links)
- A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates (Q596267) (← links)
- (Q628304) (redirect page) (← links)
- Properties of optimal schedules in preemptive shop scheduling (Q628308) (← links)
- Exact methods for the robotic cell problem (Q656059) (← links)
- Jackson's pseudo-preemptive schedule and cumulative scheduling problems (Q705501) (← links)
- Probabilistic approach to the satisfiability problem (Q808705) (← links)
- Computing redundant resources for the resource constrained project scheduling problem (Q853022) (← links)
- New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation (Q868985) (← links)
- A practical use of Jackson's preemptive schedule for solving the job shop problem (Q922282) (← links)
- The project scheduling problem with production and consumption of resources: a list-scheduling based algorithm (Q967432) (← links)
- Approximate solution of a resource-constrained scheduling problem (Q1009198) (← links)
- An optimization-based heuristic for the robotic cell problem (Q1040983) (← links)
- Scheduling jobs with release dates and tails on identical machines to minimize the makespan (Q1091256) (← links)
- The one-machine sequencing problem (Q1162927) (← links)
- Two branch and bound algorithms for the permutation flow shop problem (Q1266538) (← links)
- Jackson's pseudo preemptive schedule for the \(Pm/r_i, q_i/C_{\text{max}}\) scheduling problem (Q1273117) (← links)
- An exact method for minimizing the makespan of an application processed on a master slave bus oriented multiprocessor system (Q1293189) (← links)
- Adjustment of heads and tails for the job-shop problem (Q1341994) (← links)
- Reliability evaluation of large telecommunication networks (Q1363741) (← links)
- On linear lower bounds for the resource constrained project scheduling problem. (Q1399576) (← links)
- Evaluating network reliability and 2-edge-connected reliability in linear time for bounded pathwidth graphs (Q1578416) (← links)
- A new LP-based lower bound for the cumulative scheduling problem (Q1590042) (← links)
- Lower bounds for the event scheduling problem with consumption and production of resources (Q1686062) (← links)
- Two-stage hybrid flow shop with precedence constraints and parallel machines at second stage (Q1762032) (← links)
- Assigning spare capacities in mesh survivable networks (Q1854825) (← links)
- A decomposition algorithm for network reliability evaluation (Q1917266) (← links)
- Integer preemptive scheduling on parallel machines (Q1939681) (← links)
- A data structure for efficiently managing a set of energy functions (Q2084624) (← links)
- An \(O(n^2)\) algorithm for time-bound adjustments for the cumulative scheduling problem (Q2184136) (← links)
- On a resource-constrained scheduling problem with application to distributed systems reconfiguration (Q2371345) (← links)
- Dominance-based heuristics for one-machine total cost scheduling problems (Q2384840) (← links)
- A new constraint programming approach for the orthogonal packing problem (Q2456654) (← links)
- A new exact method for the two-dimensional bin-packing problem with fixed orientation (Q2467477) (← links)
- A new exact method for the two-dimensional orthogonal packing problem (Q2643952) (← links)
- Improving the finite element ordering for the frontal solver (Q2711234) (← links)
- (Q2861503) (← links)
- Task Ordering and Memory Management Problem for Degree of Parallelism Estimation (Q3087985) (← links)
- New data-dependent dual-feasible functions and lower bounds for a two-dimensional bin-packing problem (Q3114308) (← links)
- Factoring and reductions for networks with imperfect vertices (Q3354645) (← links)
- Une méthode arborescente pour résoudre les problèmes cumulatifs (Q3360656) (← links)
- Integrality Property in Preemptive Parallel Machine Scheduling (Q3392940) (← links)
- (Q3675537) (← links)
- (Q3723699) (← links)
- (Q3820002) (← links)
- An Algorithm for Solving the Job-Shop Problem (Q3833853) (← links)
