default search action
Mohamed Kais Msakni
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j10]Mariem Mhiri
, Mohamed Kais Msakni
Exact and heuristic approaches for maximizing flows in UAV-enabled wireless cellular networks with multi-hop backhauls. RAIRO Oper. Res. 58(1): 185-205 (2024) - 2023
- [j9]Mohamed Kais Msakni
Using machine learning prediction models for quality control: a case study from the automotive industry. Comput. Manag. Sci. 20(1): 14 (2023) - 2021
- [j8]Abeera Akbar, Anna K. A. Aasen, Mohamed Kais Msakni
An economic analysis of introducing autonomous ships in a short-sea liner shipping network. Int. Trans. Oper. Res. 28(4): 1740-1764 (2021) - [c3]Anders Risan, Mohamed Kais Msakni
A Neural Network Model for Quality Prediction in the Automotive Industry. APMS (5) 2021: 567-575 - 2020
- [j7]Carl Axel Benjamin Medbøen, Magnus Bolstad Holm, Mohamed Kais Msakni
Combining Optimization and Simulation for Designing a Robust Short-Sea Feeder Network. Algorithms 13(11): 304 (2020)
2010 – 2019
- 2019
- [j6]Ghaith Rabadi, Mohamed Kais Msakni
New characteristics of optimal solutions for the two-machine flowshop problem with unlimited buffers. J. Oper. Res. Soc. 70(6): 962-973 (2019) - [c2]Mohamed Kais Msakni
Can Autonomous Ships Help Short-Sea Shipping Become More Cost-Efficient? OR 2019: 389-395 - 2018
- [j5]Mohamed Kais Msakni
Exact methods for the quay crane scheduling problem when tasks are modeled at the single container level. Comput. Oper. Res. 99: 218-233 (2018) - 2016
- [j4]Fatih Mutlu
A comprehensive annual delivery program for upstream liquefied natural gas supply chain. Eur. J. Oper. Res. 250(1): 120-130 (2016) - [c1]Mariam Kotachi, Ghaith Rabadi, Mohamed Kais Msakni
A discrete event simulation for the logistics of Hamad's container terminal of Qatar. WSC 2016: 2262-2271 - 2013
- [j3]Anis Gharbi, Talel Ladhari
The two-machine flowshop scheduling problem with sequence-independent setup times: New lower bounding strategies. Eur. J. Oper. Res. 231(1): 69-78 (2013) - 2012
- [j2]Talel Ladhari
Minimizing the total completion time in a two-machine flowshop with sequence-independent setup times. J. Oper. Res. Soc. 63(4): 445-459 (2012) - 2010
- [j1]Anis Gharbi, Talel Ladhari
Polynomial Lower Bounds for the Two-Machine Flowshop Problem with Sequence-Independent Setup Times. Electron. Notes Discret. Math. 36: 1089-1096 (2010)
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-12-02 21:31 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: