default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAntoine Jouglet
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j22]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)- 2023
- [c6]Istenç Tarhan, Jacques Carlier, Claire Hanen, Antoine Jouglet, Alix Munier Kordon:
Parameterized Analysis of a Dynamic Programming Algorithm for a Parallel Machine Scheduling Problem. Euro-Par 2023: 139-153 - 2022
- [j21]Jacques Carlier, Abderrahim Sahli, Antoine Jouglet, Eric Pinson:
A faster checker of the energetic reasoning for the cumulative scheduling problem. Int. J. Prod. Res. 60(11): 3419-3434 (2022) - [j20]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
- [c5]Isabel Barros Garcia, Joanna Daaboul, Antoine Jouglet, Julien Le Duigou:
An Approach to Jointly Optimize the Process Plan, Scheduling, and Layout Design in Reconfigurable Manufacturing Systems. SOHOMA 2021: 403-415 - 2020
- [j19]Jacques Carlier, Eric Pinson, Abderrahim Sahli, Antoine Jouglet:
An O(n2) algorithm for time-bound adjustments for the cumulative scheduling problem. Eur. J. Oper. Res. 286(2): 468-476 (2020)
2010 – 2019
- 2018
- [j18]Ronan Bocquillon, Antoine Jouglet:
Robust routing in deterministic delay-tolerant networks. Comput. Oper. Res. 92: 77-86 (2018) - 2017
- [j17]Ronan Bocquillon, Antoine Jouglet:
A constraint-programming-based approach for solving the data dissemination problem. Comput. Oper. Res. 78: 278-289 (2017) - [j16]Ronan Bocquillon, Antoine Jouglet:
Modeling elements and solving techniques for the data dissemination problem. Eur. J. Oper. Res. 256(3): 713-728 (2017) - [j15]Ismaila Abderhamane Ndiaye, Emmanuel Néron, Antoine Jouglet:
Macroscopic evacuation plans for natural disasters. OR Spectr. 39(1): 231-272 (2017) - 2016
- [j14]Antoine Jouglet, Dritan Nace, Christophe Outteryck:
Timetabling of sorting slots in a logistic warehouse. Ann. Oper. Res. 239(1): 295-316 (2016) - 2015
- [j13]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
- [j12]Thierry Denoeux, Nicole El Zoghby, Véronique Cherfaoui, Antoine Jouglet:
Optimal Object Association in the Dempster-Shafer Framework. IEEE Trans. Cybern. 44(12): 2521-2531 (2014) - 2013
- [j11]François Clautiaux, Antoine Jouglet, Aziz Moukrim:
A New Graph-Theoretical Model for the Guillotine-Cutting Problem. INFORMS J. Comput. 25(1): 72-86 (2013) - [c4]Ronan Bocquillon, Antoine Jouglet:
Data Transfer in Delay-Tolerant Networks. BWCCA 2013: 355-359 - 2012
- [j10]Xiaokang Cao, Antoine Jouglet, Dritan Nace:
A Multi-Period Renewal equipment problem. Eur. J. Oper. Res. 218(3): 838-846 (2012) - [j9]Antoine Jouglet:
Single-machine scheduling with no idle time and release dates to minimize a regular criterion. J. Sched. 15(2): 217-238 (2012) - 2011
- [j8]Antoine Jouglet, David Savourey:
Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates. Comput. Oper. Res. 38(9): 1259-1266 (2011) - [j7]Antoine Jouglet, Jacques Carlier:
Dominance rules in combinatorial optimization problems. Eur. J. Oper. Res. 212(3): 433-444 (2011)
2000 – 2009
- 2009
- [j6]Antoine Jouglet, Ceyda Oguz, Marc Sevaux:
Hybrid Flow-Shop: a Memetic Algorithm Using Constraint-Based Scheduling for Efficient Search. J. Math. Model. Algorithms 8(3): 271-292 (2009) - 2008
- [j5]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) - [j4]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) - [c3]François Clautiaux, Antoine Jouglet, Aziz Moukrim:
A New Graph-Theoretical Model for k-Dimensional Guillotine-Cutting Problems. WEA 2008: 43-54 - 2007
- [j3]François Clautiaux, Antoine Jouglet, Joseph El Hayek:
A new lower bound for the non-oriented two-dimensional bin-packing problem. Oper. Res. Lett. 35(3): 365-373 (2007) - 2006
- [c2]David Savourey, Philippe Baptiste, Antoine Jouglet:
Lower bounds for parallel machines scheduling. RIVF 2006: 195-198 - 2004
- [j2]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) - [r1]Antoine Jouglet, Philippe Baptiste, Jacques Carlier:
Branch-and-Bound Algorithms for TotalWeighted Tardiness. Handbook of Scheduling 2004 - 2002
- [c1]Antoine Jouglet, Philippe Baptiste, Jacques Carlier:
Exact procedures for single machine total cost scheduling. SMC 2002: 4 - 2001
- [j1]Philippe Baptiste, Antoine Jouglet:
On Minimizing Total Tardiness in a Serial Batching Problem. RAIRO Oper. Res. 35(1): 107-115 (2001)
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-08-05 20:11 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:
