Jacques Carlier

From MaRDI portal
Person:319365

Available identifiers

zbMath Open carlier.jacques-gMaRDI QIDQ319365

List of research outcomes





PublicationDate of PublicationType
Measuring the slack between lower bounds for scheduling on parallel machines2024-08-15Paper
Algorithms to compute the energetic lower bounds of the cumulative scheduling problem2024-07-30Paper
Distributed rerouting in DCS mesh networks2024-07-05Paper
A data structure for efficiently managing a set of energy functions2022-10-18Paper
Polynomial algorithms for some scheduling problems with one nonrenewable resource2022-02-21Paper
An \(O(n^2)\) algorithm for time-bound adjustments for the cumulative scheduling problem2020-05-27Paper
Lower bounds for the event scheduling problem with consumption and production of resources2017-12-20Paper
The robust binomial approach to chance-constrained optimization problems with application to stochastic partitioning of large process networks2017-04-04Paper
The data transfer problem in a system of systems2016-10-06Paper
A GRASP metaheuristic for the robust mapping and routing of dataflow process networks on manycore architectures2015-09-17Paper
A preemptive bound for the resource constrained project scheduling problem2014-08-18Paper
Exact method for robotic cell problem2013-11-08Paper
Integer preemptive scheduling on parallel machines2013-03-05Paper
Two-stage hybrid flow shop with precedence constraints and parallel machines at second stage2012-11-15Paper
Dominance rules in combinatorial optimization problems2012-05-14Paper
New data-dependent dual-feasible functions and lower bounds for a two-dimensional bin-packing problem2012-02-04Paper
Exact methods for the robotic cell problem2012-01-26Paper
Task ordering and memory management problem for degree of parallelism estimation2011-08-17Paper
Properties of optimal schedules in preemptive shop scheduling2011-03-10Paper
The project scheduling problem with production and consumption of resources: a list-scheduling based algorithm2010-04-28Paper
An optimization-based heuristic for the robotic cell problem2009-11-27Paper
Integrality Property in Preemptive Parallel Machine Scheduling2009-08-18Paper
Approximate solution of a resource-constrained scheduling problem2009-03-31Paper
A new exact method for the two-dimensional bin-packing problem with fixed orientation2008-01-21Paper
A new constraint programming approach for the orthogonal packing problem2007-10-19Paper
Dominance-based heuristics for one-machine total cost scheduling problems2007-10-10Paper
A new exact method for the two-dimensional orthogonal packing problem2007-08-27Paper
On a resource-constrained scheduling problem with application to distributed systems reconfiguration2007-07-04Paper
New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation2007-02-26Paper
Computing redundant resources for the resource constrained project scheduling problem2006-11-15Paper
Heuristic and metaheuristic methods for computing graph treewidth2006-07-11Paper
Jackson's pseudo-preemptive schedule and cumulative scheduling problems2005-01-31Paper
A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates2004-08-10Paper
https://portal.mardi4nfdi.de/entity/Q44263462003-09-16Paper
On linear lower bounds for the resource constrained project scheduling problem.2003-07-30Paper
Improving the finite element ordering for the frontal solver2002-02-12Paper
Evaluating network reliability and 2-edge-connected reliability in linear time for bounded pathwidth graphs2001-01-11Paper
A new LP-based lower bound for the cumulative scheduling problem2000-12-19Paper
An Exact Method for Solving the Multi-Processor Flow-Shop2000-08-24Paper
Assigning spare capacities in mesh survivable networks2000-01-01Paper
An exact method for minimizing the makespan of an application processed on a master slave bus oriented multiprocessor system1999-06-28Paper
Jackson's pseudo preemptive schedule for the \(Pm/r_i, q_i/C_{\text{max}}\) scheduling problem1998-12-06Paper
Two branch and bound algorithms for the permutation flow shop problem1998-11-29Paper
https://portal.mardi4nfdi.de/entity/Q43536161998-04-22Paper
Reliability evaluation of large telecommunication networks1998-02-24Paper
Décomposition d'une application sur une architecture bus : propriétés des ordonnancements optimaux1997-12-17Paper
https://portal.mardi4nfdi.de/entity/Q56872661997-06-09Paper
A decomposition algorithm for network reliability evaluation1996-10-24Paper
Adjustment of heads and tails for the job-shop problem1995-01-11Paper
https://portal.mardi4nfdi.de/entity/Q43130721994-11-10Paper
Une méthode arborescente pour résoudre les problèmes cumulatifs1991-01-01Paper
Probabilistic approach to the satisfiability problem1991-01-01Paper
Factoring and reductions for networks with imperfect vertices1991-01-01Paper
A practical use of Jackson's preemptive schedule for solving the job shop problem1990-01-01Paper
An Algorithm for Solving the Job-Shop Problem1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38200021988-01-01Paper
Scheduling jobs with release dates and tails on identical machines to minimize the makespan1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37236991986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36755371985-01-01Paper
The one-machine sequencing problem1982-01-01Paper
Un domaine très ouvert : les problèmes d'ordonnancement1982-01-01Paper
Ordonnancements à contraintes disjonctives1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41081331975-01-01Paper

Research outcomes over time

This page was built for person: Jacques Carlier