Jacques Carlier

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Measuring the slack between lower bounds for scheduling on parallel machines
Annals of Operations Research
2024-08-15Paper
Algorithms to compute the energetic lower bounds of the cumulative scheduling problem
Annals of Operations Research
2024-07-30Paper
Distributed rerouting in DCS mesh networks2024-07-05Paper
A data structure for efficiently managing a set of energy functions
Journal of Combinatorial Optimization
2022-10-18Paper
Polynomial algorithms for some scheduling problems with one nonrenewable resource
RAIRO - Operations Research
2022-02-21Paper
An \(O(n^2)\) algorithm for time-bound adjustments for the cumulative scheduling problem
European Journal of Operational Research
2020-05-27Paper
Lower bounds for the event scheduling problem with consumption and production of resources
Discrete Applied Mathematics
2017-12-20Paper
The robust binomial approach to chance-constrained optimization problems with application to stochastic partitioning of large process networks
Journal of Heuristics
2017-04-04Paper
The data transfer problem in a system of systems
European Journal of Operational Research
2016-10-06Paper
A GRASP metaheuristic for the robust mapping and routing of dataflow process networks on manycore architectures
4OR
2015-09-17Paper
A preemptive bound for the resource constrained project scheduling problem
Journal of Scheduling
2014-08-18Paper
Exact method for robotic cell problem2013-11-08Paper
Integer preemptive scheduling on parallel machines
Operations Research Letters
2013-03-05Paper
Two-stage hybrid flow shop with precedence constraints and parallel machines at second stage
Computers & Operations Research
2012-11-15Paper
Dominance rules in combinatorial optimization problems
European Journal of Operational Research
2012-05-14Paper
New data-dependent dual-feasible functions and lower bounds for a two-dimensional bin-packing problem
International Journal of Production Research
2012-02-04Paper
Exact methods for the robotic cell problem
Flexible Services and Manufacturing Journal
2012-01-26Paper
Task ordering and memory management problem for degree of parallelism estimation
Lecture Notes in Computer Science
2011-08-17Paper
Properties of optimal schedules in preemptive shop scheduling
Discrete Applied Mathematics
2011-03-10Paper
The project scheduling problem with production and consumption of resources: a list-scheduling based algorithm
Discrete Applied Mathematics
2010-04-28Paper
An optimization-based heuristic for the robotic cell problem
European Journal of Operational Research
2009-11-27Paper
Integrality Property in Preemptive Parallel Machine Scheduling
Computer Science - Theory and Applications
2009-08-18Paper
Approximate solution of a resource-constrained scheduling problem
Journal of Heuristics
2009-03-31Paper
A new exact method for the two-dimensional bin-packing problem with fixed orientation
Operations Research Letters
2008-01-21Paper
A new constraint programming approach for the orthogonal packing problem
Computers & Operations Research
2007-10-19Paper
Dominance-based heuristics for one-machine total cost scheduling problems
European Journal of Operational Research
2007-10-10Paper
A new exact method for the two-dimensional orthogonal packing problem
European Journal of Operational Research
2007-08-27Paper
On a resource-constrained scheduling problem with application to distributed systems reconfiguration
European Journal of Operational Research
2007-07-04Paper
New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
Computers & Operations Research
2007-02-26Paper
Computing redundant resources for the resource constrained project scheduling problem
European Journal of Operational Research
2006-11-15Paper
Heuristic and metaheuristic methods for computing graph treewidth
RAIRO - Operations Research
2006-07-11Paper
Heuristic and metaheuristic methods for computing graph treewidth
RAIRO - Operations Research
2006-07-11Paper
Heuristic and metaheuristic methods for computing graph treewidth
RAIRO - Operations Research
2006-07-11Paper
Jackson's pseudo-preemptive schedule and cumulative scheduling problems
Discrete Applied Mathematics
2005-01-31Paper
A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates
European Journal of Operational Research
2004-08-10Paper
scientific article; zbMATH DE number 1982177 (Why is no real title available?)2003-09-16Paper
On linear lower bounds for the resource constrained project scheduling problem.
European Journal of Operational Research
2003-07-30Paper
Improving the finite element ordering for the frontal solver
Revue Européenne des Éléments Finis
2002-02-12Paper
Evaluating network reliability and 2-edge-connected reliability in linear time for bounded pathwidth graphs
Algorithmica
2001-01-11Paper
A new LP-based lower bound for the cumulative scheduling problem
European Journal of Operational Research
2000-12-19Paper
An Exact Method for Solving the Multi-Processor Flow-Shop
RAIRO - Operations Research
2000-08-24Paper
An Exact Method for Solving the Multi-Processor Flow-Shop
RAIRO - Operations Research
2000-08-24Paper
Assigning spare capacities in mesh survivable networks
Telecommunication Systems
2000-01-01Paper
An exact method for minimizing the makespan of an application processed on a master slave bus oriented multiprocessor system
Discrete Applied Mathematics
1999-06-28Paper
Jackson's pseudo preemptive schedule for the \(Pm/r_i, q_i/C_{\text{max}}\) scheduling problem
Annals of Operations Research
1998-12-06Paper
Two branch and bound algorithms for the permutation flow shop problem
European Journal of Operational Research
1998-11-29Paper
scientific article; zbMATH DE number 1059311 (Why is no real title available?)1998-04-22Paper
Reliability evaluation of large telecommunication networks
Discrete Applied Mathematics
1998-02-24Paper
Décomposition d'une application sur une architecture bus : propriétés des ordonnancements optimaux
RAIRO - Operations Research
1997-12-17Paper
scientific article; zbMATH DE number 956858 (Why is no real title available?)1997-06-09Paper
A decomposition algorithm for network reliability evaluation
Discrete Applied Mathematics
1996-10-24Paper
Adjustment of heads and tails for the job-shop problem
European Journal of Operational Research
1995-01-11Paper
scientific article; zbMATH DE number 686978 (Why is no real title available?)1994-11-10Paper
Une méthode arborescente pour résoudre les problèmes cumulatifs
RAIRO - Operations Research
1991-01-01Paper
Probabilistic approach to the satisfiability problem
Theoretical Computer Science
1991-01-01Paper
Factoring and reductions for networks with imperfect vertices
IEEE Transactions on Reliability
1991-01-01Paper
A practical use of Jackson's preemptive schedule for solving the job shop problem
Annals of Operations Research
1990-01-01Paper
An Algorithm for Solving the Job-Shop Problem
Management Science
1989-01-01Paper
scientific article; zbMATH DE number 4092766 (Why is no real title available?)1988-01-01Paper
Scheduling jobs with release dates and tails on identical machines to minimize the makespan
European Journal of Operational Research
1987-01-01Paper
scientific article; zbMATH DE number 3954272 (Why is no real title available?)1986-01-01Paper
scientific article; zbMATH DE number 3896317 (Why is no real title available?)1985-01-01Paper
The one-machine sequencing problem
European Journal of Operational Research
1982-01-01Paper
Un domaine très ouvert : les problèmes d'ordonnancement
RAIRO - Operations Research
1982-01-01Paper
Ordonnancements à contraintes disjonctives
RAIRO - Operations Research
1978-01-01Paper
scientific article; zbMATH DE number 3531181 (Why is no real title available?)1975-01-01Paper


Research outcomes over time


This page was built for person: Jacques Carlier