default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMansour Eddaly
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Bassem Jarboui, Malek Masmoudi
, Mansour Eddaly:
Epsilon Oscillation Algorithm for the bi-objective green identical parallel machine scheduling problem. Comput. Oper. Res. 170: 106754 (2024)- [j11]Bassem Jarboui, Mansour Eddaly:
A branch-and-bound approach to the no-idle flowshop scheduling problem. Discret. Appl. Math. 347: 297-310 (2024) - 2023
- [j10]Wahiba Jomaa, Mansour Eddaly, Bassem Jarboui:
Mixed integer linear programming formulations for the permutation flow shop scheduling problem with preventive maintenance activities. Int. J. Math. Oper. Res. 25(2): 139-160 (2023) - 2021
- [j9]Nejah Ben Mabrouk, Bassem Jarboui, Mansour Eddaly:
Solving the joint production distribution problem by the variable neighbourhood search algorithm. Int. J. Math. Oper. Res. 18(4): 484-502 (2021) - [j8]Wahiba Jomaa, Mansour Eddaly, Bassem Jarboui:
Variable neighborhood search algorithms for the permutation flowshop scheduling problem with the preventive maintenance. Oper. Res. 21(4): 2525-2542 (2021)
2010 – 2019
- 2017
- [j7]Marwa Amous, Said Toumi, Bassem Jarboui, Mansour Eddaly:
A variable neighborhood search algorithm for the capacitated vehicle routing problem. Electron. Notes Discret. Math. 58: 231-238 (2017) - [j6]Said Toumi, Bassem Jarboui, Mansour Eddaly, Abdelwaheb Rebaï:
Branch-and-bound algorithm for solving blocking flowshop scheduling problems with makespan criterion. Int. J. Math. Oper. Res. 10(1): 34-48 (2017) - 2016
- [j5]Mansour Eddaly, Bassem Jarboui, Patrick Siarry:
Combinatorial particle swarm optimization for solving blocking flowshop scheduling problem. J. Comput. Des. Eng. 3(4): 295-311 (2016) - 2012
- [j4]Ridha Erromdhani, Mansour Eddaly, Abdelwaheb Rebaï:
Hierarchical production planning with flexibility in agroalimentary environment: a case study. J. Intell. Manuf. 23(3): 811-819 (2012) - 2011
- [j3]Radhouan Bouabda, Bassem Jarboui, Mansour Eddaly, Abdelwaheb Rebaï:
A branch and bound enhanced genetic algorithm for scheduling a flowline manufacturing cell with sequence dependent family setup times. Comput. Oper. Res. 38(1): 387-393 (2011) - 2010
- [j2]Noura Beji, Bassem Jarboui, Mansour Eddaly, Habib Chabchoub:
A Hybrid Particle Swarm Optimization Algorithm for the Redundancy Allocation Problem. J. Comput. Sci. 1(3): 159-167 (2010)
2000 – 2009
- 2009
- [j1]Bassem Jarboui, Mansour Eddaly, Patrick Siarry:
An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems. Comput. Oper. Res. 36(9): 2638-2646 (2009) - [p1]Mansour Eddaly, Bassem Jarboui, Patrick Siarry, Abdelwaheb Rebaï:
An Estimation of Distribution Algorithm for Flowshop Scheduling with Limited Buffers. Natural Intelligence for Scheduling, Planning and Packing Problems 2009: 89-110
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-03 21:10 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:
