default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXavier Delorme
- > Home > Persons > Xavier Delorme
Publications
- 2019
[j18]Xavier Delorme
, Alexandre Dolgui, Sergey Kovalev, Mikhail Y. Kovalyov:
Minimizing the number of workers in a paced mixed-model assembly line. Eur. J. Oper. Res. 272(1): 188-194 (2019)- 2018
- [j16]Akram Chibani, Xavier Delorme, Alexandre Dolgui, Henri Pierreval:
Dynamic optimisation for highly agile supply chains in e-procurement context. Int. J. Prod. Res. 56(17): 5904-5929 (2018) - 2017
- [j15]Sergey Kovalev, Xavier Delorme, Alexandre Dolgui, Ammar Oulamara:
Minimizing the number of stations and station activation costs for a production line. Comput. Oper. Res. 79: 131-139 (2017) - 2015
- [j14]Öncü Hazir, Xavier Delorme, Alexandre Dolgui:
A review of cost and profit oriented line design and balancing problems and solution approaches. Annu. Rev. Control. 40: 14-24 (2015) - 2014
- [c5]Akram Chibani, Xavier Delorme, Alexandre Dolgui, Henri Pierreval:
Dealing with Variations for a Supplier Selection Problem in a Flexible Supply Chain - A Dynamic Optimization Approach. ICORES 2014: 322-327 - 2013
- [j13]Kseniya Schemeleva, Xavier Delorme, Alexandre Dolgui, Frédéric Grimaud, Mikhail Y. Kovalyov:
Lot-sizing on a single imperfect machine: ILP models and FPTAS extensions. Comput. Ind. Eng. 65(4): 561-569 (2013) - [j12]Pavel A. Borisovsky, Xavier Delorme, Alexandre Dolgui:
Genetic algorithm for balancing reconfigurable machining lines. Comput. Ind. Eng. 66(3): 541-547 (2013) - [j11]Xavier Delorme, Alexandre Dolgui, Alexander A. Kolokolov:
Complex Optimization Problems in Locational Analysis and Scheduling. J. Math. Model. Algorithms Oper. Res. 12(2): 101-103 (2013) - [j10]Alberto García-Villoria, Albert Corominas, Xavier Delorme, Alexandre Dolgui, Wieslaw Kubiak, Rafael Pastor:
A branch and bound algorithm for the response time variability problem. J. Sched. 16(2): 243-252 (2013) - [c4]Olga Battaïa, Xavier Delorme, Alexandre Dolgui, Frédéric Grimaud:
Integrated Decision Making in Flow Line Balancing. MIM 2013: 831-838 - 2012
- [j9]Kseniya Schemeleva, Xavier Delorme, Alexandre Dolgui, Frédéric Grimaud:
Multi-product sequencing and lot-sizing under uncertainties: A memetic algorithm. Eng. Appl. Artif. Intell. 25(8): 1598-1610 (2012) - [j8]Sergey Kovalev, Xavier Delorme, Alexandre Dolgui:
Line configuration to minimize setup costs. Math. Comput. Model. 55(9-10): 2087-2095 (2012) - 2010
- [j7]Mohamed Essafi, Xavier Delorme, Alexandre Dolgui, Olga Guschinskaya:
A MIP approach for balancing transfer line with complex industrial constraints. Comput. Ind. Eng. 58(3): 393-400 (2010) - [j6]Faicel Hnaien, Xavier Delorme, Alexandre Dolgui:
Multi-objective optimization for inventory control in two-level assembly systems under uncertainty of lead times. Comput. Oper. Res. 37(11): 1835-1843 (2010) - 2009
- [j4]Faicel Hnaien, Xavier Delorme, Alexandre Dolgui:
Genetic algorithm for supply planning in two-level assembly systems with random lead times. Eng. Appl. Artif. Intell. 22(6): 906-915 (2009) - [p1]Xavier Delorme, Alexandre Dolgui, Mohamed Essafi, Laurent Linxe, Damien Poyard:
Machining Lines Automation. Handbook of Automation 2009: 599-617
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-06-19 21:52 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:
