default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaolo Gianessi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Xavier Delorme
, Paolo Gianessi:
Line balancing and task scheduling to minimise power peak of reconfigurable manufacturing systems. Int. J. Prod. Res. 62(14): 5061-5086 (2024)- 2023
- [j5]Alaa Daoud, Flavien Balbo, Paolo Gianessi, Gauthier Picard:
AV-OLRA : Une modélisation générique pour le problème de l'allocation des ressources dans le domaine du transport à la demande. Rev. Ouverte Intell. Artif. 4(2): 169-192 (2023) - [c8]Alaa Daoud, Gauthier Picard, Hiba Alqasir, Paolo Gianessi, Flavien Balbo:
Communication-wise Comparison of the Online Resource Allocation Methods in CAV Fleets. ANT/EDI40 2023: 299-306 - 2021
- [j4]Alaa Daoud, Flavien Balbo, Paolo Gianessi, Gauthier Picard:
ORNInA: A decentralized, auction-based multi-agent coordination in ODT systems. AI Commun. 34(1): 37-53 (2021) - [c7]Alaa Daoud, Flavien Balbo, Paolo Gianessi, Gauthier Picard:
A Generic Multi-Agent Model for Resource Allocation Strategies in Online On-Demand Transport with Autonomous Vehicles. AAMAS 2021: 1489-1491 - [c6]Alaa Daoud, Flavien Balbo, Paolo Gianessi, Gauthier Picard:
Un modèle agent générique pour la comparaison d'approches d'allocation de ressources dans le domaine du transport à la demande. JFSMA 2021: 127-136 - 2020
- [c5]Alaa Daoud, Flavien Balbo, Paolo Gianessi, Gauthier Picard:
Decentralized Insertion Heuristic with Runtime Optimization for On-demand Transport Scheduling. ATT@ECAI 2020: 9-15 - [c4]Audrey Cerqueus, Paolo Gianessi, Damien Lamy, Xavier Delorme:
Balancing and Configuration Planning of RMS to Minimize Energy Cost. APMS (2) 2020: 518-526 - [c3]Mahdi El Alaoui El Abdellaoui, Emmanuel Bricard, Frédéric Grimaud, Paolo Gianessi, Xavier Delorme:
Scalable, Reconfigurable Simulation Models in Industry 4.0-Oriented Enterprise Modeling. WSC 2020: 2755-2766
2010 – 2019
- 2019
- [c2]Paolo Gianessi, Xavier Delorme, Oussama Masmoudi:
Simple Assembly Line Balancing Problem with Power Peak Minimization. APMS (1) 2019: 239-247 - 2016
- [j3]Paolo Gianessi, Alberto Ceselli, Lucas Létocart, Roberto Wolfler Calvo:
A Branch&Price&Cut algorithm for the Vehicle Routing Problem with Intermediate Replenishment Facilities. Electron. Notes Discret. Math. 55: 93-96 (2016) - [j2]Paolo Gianessi, Laurent Alfandari, Lucas Létocart, Roberto Wolfler Calvo:
The Multicommodity-Ring Location Routing Problem. Transp. Sci. 50(2): 541-558 (2016) - 2015
- [j1]Yanik Ngoko, Christophe Cérin, Paolo Gianessi, Congfeng Jiang:
Energy-aware service provisioning in volunteers clouds. Int. J. Big Data Intell. 2(4): 262-284 (2015) - 2014
- [b1]Paolo Gianessi:
Solving strategic and tactical optimization problems in city logistics. (Optimisation Stratégique et tactique en logistique urbaine). Paris 13 University, Villetaneuse, Saint-Denis, Bobigny, France, 2014 - [c1]Congfeng Jiang, Jian Wan, Christophe Cérin, Paolo Gianessi, Yanik Ngoko:
Towards Energy Efficient Allocation for Applications in Volunteer Cloud. IPDPS Workshops 2014: 1516-1525
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-07-19 19:13 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:
