default search action
Faicel Hnaien
Person information
- affiliation: University of Technology of Troyes, LIST3N, Troyes, France
- affiliation (PhD 2008): Ecole des Mines de Saint Etienne, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c14]Ilhem Slama, Taha Arbaoui, Faicel Hnaien, Oussama Ben-Ammar, Belgacem Bettayeb, Alexandre Dolgui:
Simultaneous Backward Reduction algorithm for disassembly lot-sizing under random ordering lead time. CoDIT 2024: 2114-2119 - [c13]Yousra Farhani
, Malak Saiem
Enhanced QUBO Formulations for The Flow Shop Scheduling Problem. GECCO Companion 2024: 1942-1949 - 2023
- [j19]Faicel Hnaien, Taha Arbaoui
Minimizing the makespan for the two-machine flow shop scheduling problem with random breakdown. Ann. Oper. Res. 328(2): 1437-1460 (2023) - [j18]Heibatolah Sadeghi, Hêris Golpîra, Faicel Hnaien, Cosimo Magazzino
Pricing-inventory model with discrete demand and delivery orders. Oper. Res. Decis. 33(3) (2023) - [c12]Malak Saiem, Valeria Borodin, Faicel Hnaien, Hichem Snoussi:
Predictive maintenance planning for railway systems. CiSt 2023: 553-558 - [c11]Malak Saiem
Solving the Flow-Shop Scheduling problem using Grover's Algorithm. GECCO Companion 2023: 2250-2253 - [c10]Oumayma Laouini, Ilhem Slama, Faicel Hnaien, Zied Jemaï:
Two-stage Stochastic Program for Capacitated Disassembly Lot-sizing Under Random Yield. ICNSC 2023: 1-6 - 2022
- [j17]Minh Hung Ho
Exact method to optimize the total electricity cost in two-machine permutation flow shop scheduling problem under Time-of-use tariff. Comput. Oper. Res. 144: 105788 (2022) - [j16]Sana Frifita
A robust optimization approach for disassembly assembly routing problem under uncertain yields. Expert Syst. Appl. 202: 117304 (2022) - 2021
- [j15]Minh Hung Ho
Electricity cost minimisation for optimal makespan solution in flow shop scheduling under time-of-use tariffs. Int. J. Prod. Res. 59(4): 1041-1067 (2021) - 2020
- [j14]Oussama Ben-Ammar
A hybrid genetic algorithm for a multilevel assembly replenishment planning problem with stochastic lead times. Comput. Ind. Eng. 149: 106794 (2020) - [j13]Hasan Murat Afsar, Faicel Hnaien:
Formulations and solution algorithms for dynamic assembly routing problem. Int. J. Prod. Res. 58(3): 671-688 (2020)
2010 – 2019
- 2019
- [j12]Mourad Benttaleb, Faicel Hnaien, Farouk Yalaoui:
Minimising the makespan in the two-machine job shop problem under availability constraints. Int. J. Prod. Res. 57(5): 1427-1457 (2019) - 2018
- [j11]Mourad Benttaleb, Faicel Hnaien, Farouk Yalaoui:
Two-machine job shop problem under availability constraints on one machine: Makespan minimization. Comput. Ind. Eng. 117: 138-151 (2018) - [j10]Valeria Borodin, Hichem Snoussi, Faicel Hnaien, Nacima Labadie:
Signal processing on graphs: Case of sampling in Paley-Wiener spaces. Signal Process. 152: 130-140 (2018) - 2016
- [j9]Valeria Borodin
Handling uncertainty in agricultural supply chain management: A state of the art. Eur. J. Oper. Res. 254(2): 348-359 (2016) - [j8]Julien Autuori
A mapping technique for better solution exploration: NSGA-II adaptation. J. Heuristics 22(1): 89-123 (2016) - [j7]Matthieu Le Berre, Maher Rebai, Faicel Hnaien, Hichem Snoussi:
A bi-objective model for wireless sensor deployment considering coverage and tracking applications. Int. J. Sens. Networks 22(1): 47-57 (2016) - 2015
- [j6]Maher Rebai, Matthieu Le Berre, Hichem Snoussi, Faicel Hnaien, Lyes Khoukhi:
Sensor deployment optimization methods to achieve both coverage and connectivity in wireless sensor networks. Comput. Oper. Res. 59: 11-21 (2015) - [j5]Valeria Borodin, Jean Bourtembourg, Faicel Hnaien, Nacima Labadie:
A multi-step rolled forward chance-constrained model and a proactive dynamic approach for the wheat crop quality control problem. Eur. J. Oper. Res. 246(2): 631-640 (2015) - [j4]Matthieu Le Berre, Maher Rebai, Faicel Hnaien, Hichem Snoussi:
A Specific Heuristic Dedicated to a Coverage/Tracking Bi-objective Problem for Wireless Sensor Deployment. Wirel. Pers. Commun. 84(3): 2187-2213 (2015) - 2014
- [j3]Maher Rebai, Matthieu Le Berre
A Branch and Bound Algorithm for the Critical Grid Coverage Problem in Wireless Sensor Networks. Int. J. Distributed Sens. Networks 10 (2014) - [c9]Valeria Borodin, Jean Bourtembourg, Faicel Hnaien
A Decision Support System for Efficient Crop Production Supply Chain Management. ICCSA (5) 2014: 775-790 - [c8]Valeria Borodin, Jean Bourtembourg, Faicel Hnaien
An Interval Programming Approach for an Operational Transportation Planning Problem. IPMU (1) 2014: 117-126 - 2013
- [c7]Valeria Borodin, Faicel Hnaien
A discrete event simulation model for harvest operations under stochastic conditions. ICNSC 2013: 708-713 - [c6]Oussama Ben Ammar
Supply Planning and Inventory Control under Lead Time Uncertainty: A Review. MIM 2013: 359-370 - [c5]Faicel Hnaien
Integration of Additional Purchase Cost to Reduce the Lead Time Uncertainty for One Level Assembly System. MIM 2013: 383-388 - [c4]Faicel Hnaien
A Bi-Criteria Flow-Shop Scheduling with Preventive Maintenance. MIM 2013: 1387-1392 - 2010
- [j2]Faicel Hnaien
Multi-objective optimization for inventory control in two-level assembly systems under uncertainty of lead times. Comput. Oper. Res. 37(11): 1835-1843 (2010) - [c3]Yassine Ouazene
The Joint Load Balancing and Parallel Machine Scheduling Problem. OR 2010: 497-502
2000 – 2009
- 2009
- [j1]Faicel Hnaien
Genetic algorithm for supply planning in two-level assembly systems with random lead times. Eng. Appl. Artif. Intell. 22(6): 906-915 (2009) - 2008
- [c2]Mohamed-Aly Louly, Alexandre Dolgui
Planned lead times for one-level assembly system with service level constraint. ETFA 2008: 1504-1511 - 2006
- [c1]Faicel Hnaien
A Supply Planning Model for Multilevel Assembly Systems Under Random Lead Times. ETFA 2006: 1348-1351
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-11-14 00:52 CET 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: