default search action
Jacques Carlier
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j45]Jacques Carlier, Antoine Jouglet
, Abderrahim Sahli
Algorithms to compute the energetic lower bounds of the cumulative scheduling problem. Ann. Oper. Res. 337(2): 683-713 (2024) - [j44]Jacques Carlier, Claire Hanen
Measuring the slack between lower bounds for scheduling on parallel machines. Ann. Oper. Res. 338(1): 347-377 (2024) - 2023
- [c19]Istenç Tarhan
Parameterized Analysis of a Dynamic Programming Algorithm for a Parallel Machine Scheduling Problem. Euro-Par 2023: 139-153 - 2022
- [j43]Jacques Carlier, Abderrahim Sahli
A faster checker of the energetic reasoning for the cumulative scheduling problem. Int. J. Prod. Res. 60(11): 3419-3434 (2022) - [j42]Jacques Carlier, Antoine Jouglet, Eric Pinson, Abderrahim Sahli
A data structure for efficiently managing a set of energy functions. J. Comb. Optim. 44(4): 2460-2481 (2022) - 2021
- [j41]Abderrahim Sahli
Polynomial algorithms for some scheduling problems with one nonrenewable resource. RAIRO Oper. Res. 55(6): 3493-3511 (2021) - 2020
- [j40]Jacques Carlier, Eric Pinson, Abderrahim Sahli
An O(n2) algorithm for time-bound adjustments for the cumulative scheduling problem. Eur. J. Oper. Res. 286(2): 468-476 (2020)
2010 – 2019
- 2019
- [j39]Jacques Carlier, Joël Lattmann, Jean-Luc Lutton, Dritan Nace, Thanh Son Pham:
An automatic restoration scheme for switch-based networks. Ad Hoc Networks 89: 78-87 (2019) - 2018
- [j38]Jacques Carlier, Aziz Moukrim, Abderrahim Sahli
Lower bounds for the Event Scheduling Problem with Consumption and Production of Resources. Discret. Appl. Math. 234: 178-194 (2018) - 2017
- [c18]Julien Collet, Tanguy Sassolas, Yves Lhuillier, Renaud Sirdey
Exploration of de Bruijn Graph Filtering for de novo Assembly Using GraphLab. IPDPS Workshops 2017: 530-539 - 2016
- [c17]Julien Collet, Tanguy Sassolas, Yves Lhuillier, Renaud Sirdey
Leveraging distributed GraphLab for program trace analysis. HPCS 2016: 238-245 - 2015
- [j37]Oana Stan
A GRASP metaheuristic for the robust mapping and routing of dataflow process networks on manycore architectures. 4OR 13(3): 309-334 (2015) - [j36]Ronan Bocquillon, Antoine Jouglet, Jacques Carlier:
The data transfer problem in a system of systems. Eur. J. Oper. Res. 244(2): 392-403 (2015) - 2014
- [j35]Oana Stan
The robust binomial approach to chance-constrained optimization problems with application to stochastic partitioning of large process networks. J. Heuristics 20(3): 261-290 (2014) - [j34]Mohamed Haouari
A preemptive bound for the Resource Constrained Project Scheduling Problem. J. Sched. 17(3): 237-248 (2014) - 2013
- [c16]Thanh Son Pham, Jacques Carlier, Joël Lattmann, Jean-Luc Lutton, Dritan Nace, Laurent Valeyre:
A Fully Distributed Resilient Routing Scheme for Switch-Based Networks. 3PGCIC 2013: 92-97 - [c15]Oana Stan
A GRASP for Placement and Routing of Dataflow Process Networks on Many-Core Architectures. 3PGCIC 2013: 219-226 - 2012
- [j33]Sergiu Carpov
Two-stage hybrid flow shop with precedence constraints and parallel machines at second stage. Comput. Oper. Res. 39(3): 736-745 (2012) - [j32]Philippe Baptiste, Jacques Carlier, Alexander V. Kononov, Maurice Queyranne, Sergey Sevastyanov
Integer preemptive scheduling on parallel machines. Oper. Res. Lett. 40(6): 440-444 (2012) - [c14]Thanh Son Pham, Joël Lattmann, Jean-Luc Lutton, Laurent Valeyre, Jacques Carlier, Dritan Nace:
A restoration scheme for virtual networks using switches. ICUMT 2012: 800-805 - 2011
- [j31]Philippe Baptiste, Jacques Carlier, Alexander V. Kononov, Maurice Queyranne, Sergey Sevastyanov
Properties of optimal schedules in preemptive shop scheduling. Discret. Appl. Math. 159(5): 272-280 (2011) - [j30]Antoine Jouglet, Jacques Carlier:
Dominance rules in combinatorial optimization problems. Eur. J. Oper. Res. 212(3): 433-444 (2011) - [c13]Sergiu Carpov
Task Ordering and Memory Management Problem for Degree of Parallelism Estimation. COCOON 2011: 592-603 - [c12]Sergiu Carpov
Probabilistic Parameters of Conditional Task Graphs. NBiS 2011: 376-381 - 2010
- [j29]Jacques Carlier, Fatma Hermès, Aziz Moukrim
Exact resolution of the one-machine sequencing problem with no machine idle time. Comput. Ind. Eng. 59(2): 193-199 (2010) - [j28]Sergiu Carpov
Speculative data prefetching for branching structures in dataflow programms. Electron. Notes Discret. Math. 36: 119-126 (2010) - [j27]Mohamed Kharbeche
Exact Method for Robotic Cell Problem. Electron. Notes Discret. Math. 36: 859-866 (2010) - [j26]Jacques Carlier, Mohamed Haouari
An optimization-based heuristic for the robotic cell problem. Eur. J. Oper. Res. 202(3): 636-645 (2010)
2000 – 2009
- 2009
- [j25]Jacques Carlier, Aziz Moukrim
The project scheduling problem with production and consumption of resources: A list-scheduling based algorithm. Discret. Appl. Math. 157(17): 3631-3642 (2009) - [j24]Renaud Sirdey
Approximate solution of a resource-constrained scheduling problem. J. Heuristics 15(1): 1-17 (2009) - [c11]Philippe Baptiste, Jacques Carlier, Alexander V. Kononov
Integrality Property in Preemptive Parallel Machine Scheduling. CSR 2009: 38-46 - [c10]Fatma Hermès, Jacques Carlier, Aziz Moukrim, Khaled Ghédira:
Minimizing the Makespan in Two-machine Job Shop Scheduling Problems with no Machine Idle-time. ICINCO-ICSO 2009: 89-96 - 2008
- [j23]François Clautiaux, Antoine Jouglet, Jacques Carlier, Aziz Moukrim
A new constraint programming approach for the orthogonal packing problem. Comput. Oper. Res. 35(3): 944-959 (2008) - [j22]Dominique de Werra, Endre Boros, Jacques Carlier, Alain Hertz, Marino Widmer
Foreword. Discret. Appl. Math. 156(13): 2437-2438 (2008) - [j21]Antoine Jouglet, David Savourey, Jacques Carlier, Philippe Baptiste:
Dominance-based heuristics for one-machine total cost scheduling problems. Eur. J. Oper. Res. 184(3): 879-899 (2008) - 2007
- [j20]Jacques Carlier, François Clautiaux, Aziz Moukrim
New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation. Comput. Oper. Res. 34(8): 2223-2250 (2007) - [j19]Jacques Carlier, Emmanuel Néron:
Computing redundant resources for the resource constrained project scheduling problem. Eur. J. Oper. Res. 176(3): 1452-1463 (2007) - [j18]Renaud Sirdey
On a resource-constrained scheduling problem with application to distributed systems reconfiguration. Eur. J. Oper. Res. 183(2): 546-563 (2007) - [j17]François Clautiaux, Jacques Carlier, Aziz Moukrim
A new exact method for the two-dimensional orthogonal packing problem. Eur. J. Oper. Res. 183(3): 1196-1211 (2007) - [j16]François Clautiaux, Jacques Carlier, Aziz Moukrim
A new exact method for the two-dimensional bin-packing problem with fixed orientation. Oper. Res. Lett. 35(3): 357-364 (2007) - 2004
- [j15]Philippe Baptiste, Jacques Carlier, Alix Munier, Andreas S. Schulz:
Introduction. Ann. Oper. Res. 129(1-4): 17-19 (2004) - [j14]Jacques Carlier, Eric Pinson:
Jackson's pseudo-preemptive schedule and cumulative scheduling problems. Discret. Appl. Math. 145(1): 80-94 (2004) - [j13]Philippe Baptiste, Jacques Carlier, Antoine Jouglet:
A Branch-and-Bound procedure to minimize total tardiness on one machine with arbitrary release dates. Eur. J. Oper. Res. 158(3): 595-608 (2004) - [j12]François Clautiaux, Aziz Moukrim
Heuristic and metaheuristic methods for computing graph treewidth. RAIRO Oper. Res. 38(1): 13-26 (2004) - [r2]Jacques Carlier, Laurent Péridy, Eric Pinson, David Rivreau:
Elimination Rules for Job-Shop Scheduling Problem. Handbook of Scheduling 2004 - [r1]Antoine Jouglet, Philippe Baptiste, Jacques Carlier:
Branch-and-Bound Algorithms for TotalWeighted Tardiness. Handbook of Scheduling 2004 - 2003
- [j11]Jacques Carlier, Emmanuel Néron:
On linear lower bounds for the resource constrained project scheduling problem. Eur. J. Oper. Res. 149(2): 314-324 (2003) - [c9]François Clautiaux, Jacques Carlier, Aziz Moukrim, Stéphane Nègre:
New Lower and Upper Bounds for Graph Treewidth. WEA 2003: 70-80 - 2002
- [c8]Antoine Jouglet, Philippe Baptiste, Jacques Carlier:
Exact procedures for single machine total cost scheduling. SMC 2002: 4 - 2000
- [j10]Corinne Lucet, Jean-Francois Manouvrier, Jacques Carlier:
Evaluating Network Reliability and 2-Edge-Connected Reliability in Linear Time for Bounded Pathwidth Graphs. Algorithmica 27(3): 316-336 (2000) - [j9]Jacques Carlier, Emmanuel Néron:
A new LP-based lower bound for the cumulative scheduling problem. Eur. J. Oper. Res. 127(2): 363-382 (2000) - [j8]Jacques Carlier, Emmanuel Néron:
An Exact Method for Solving the Multi-Processor Flow-Shop. RAIRO Oper. Res. 34(1): 1-25 (2000) - [j7]Jean-Luc Lutton, Dritan Nace, Jacques Carlier:
Assigning spare capacities in mesh survivable networks. Telecommun. Syst. 13(2-4): 441-451 (2000)
1990 – 1999
- 1999
- [j6]Jacques Carlier, Alain Hertz, Frédéric Maffray, Marino Widmer:
Preface. Discret. Appl. Math. 94(1-3): 1 (1999) - [j5]Jean-Paul Boufflet
An Exact Method for Minimizing the Makespan of an Application Processed on a Master Slave Bus Oriented Multiprocessor System. Discret. Appl. Math. 94(1-3): 51-76 (1999) - [c7]Dritan Nace, Jacques Carlier, Jean-Luc Lutton:
Issues in Distributed Rerouting On High Speed Networks. OPODIS 1999: 205-214 - 1998
- [j4]Jacques Carlier, Eric Pinson:
Jackson's Pseudo Preemptive Schedule for the Pm/r i , q i /C max scheduling problem. Ann. Oper. Res. 83: 41-58 (1998) - [c6]Jacques Carlier, Stéphane Cateloin, Christophe Beaujean:
An Optimal Routing Technique: the Proportional Routing. OPODIS 1998: 227-241 - 1997
- [j3]Jacques Carlier, Yu Li, Jean-Luc Lutton:
Reliability Evaluation of Large Telecommunication Networks. Discret. Appl. Math. 76(1-3): 61-80 (1997) - [c5]Jacques Carlier, Eric Pinson:
Bounds and adjustments associated with the Pm/ri, qi/Cmax scheduling problem. JFPLC 1997: 169- - [c4]Jean-Luc Lutton, Dritan Nace, Jacques Carlier:
Contribution in Assignment of Spare Capacities in Reconfigurable. OPODIS 1997: 183-192 - 1996
- [j2]Jacques Carlier, Corinne Lucet:
A Decomposition Algorithm for Network Reliability Evaluation. Discret. Appl. Math. 65(1-3): 141-156 (1996) - 1995
- [c3]Dritan Nace, Jacques Carlier:
Distributed Rerouting in DCS Mesh Networks. Combinatorics and Computer Science 1995: 406-415 - 1993
- [c2]Olivier Dubois, Pascal André, Yacine Boufkhad, Jacques Carlier:
SAT versus UNSAT. Cliques, Coloring, and Satisfiability 1993: 415-436 - [c1]Jacques Carlier, Yu Li, Jean-Luc Lutton:
Evaluation of telecommunication network performances. System Modelling and Optimization 1993: 863-874 - 1991
- [j1]Olivier Dubois, Jacques Carlier:
Probabilistic approach to the Satisfiability Problem. Theor. Comput. Sci. 81(1): 65-75 (1991)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: