Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Mohamed Kais Msakni"'
Publikováno v:
Maritime Transport Research, Vol 7, Iss , Pp 100118- (2024)
This study addresses the pressing need for the Norwegian fishery sector to align with national reduction targets and mitigate its environmental impact. Norway has committed to reducing GHG emissions from the fishery sector by at least 40% by 2030 and
Externí odkaz:
https://doaj.org/article/1bb35ce8bb21425e897d6d9cabbf4f18
Publikováno v:
Computational Management Science. 20
This paper studies a prediction problem using time series data and machine learning algorithms. The case study is related to the quality control of bumper beams in the automotive industry. These parts are milled during the production process, and the
Autor:
Mohamed Kais Msakni, Elizabeth Lindstad, Abeera Akbar, Frank Meisel, Anna Kristine Almestad Aasen, Kjetil Fagerholt
Publikováno v:
International Transactions in Operational Research
The development of autonomous ships is at an advanced stage. It seems to be just a question of time before such ships become available at an industrial scale. In this paper, we investigate the economic advantages of utilizing autonomous over conventi
Publikováno v:
Computers & Operations Research. 99:218-233
The scheduling of quay cranes (QCs) to minimize the handling time of a berthed vessel is one of the most important operations in container terminals as it impacts the terminal's overall productivity. In this paper, we propose two exact methods to sol
Publikováno v:
Advances in Production Management Systems. Artificial Intelligence for Sustainable and Resilient Production Systems ISBN: 9783030859138
In this paper, we present a machine learning application for the automotive industry. We study the use of neural networks to predict the location of milled holes in a bumper beam using historical measurement data. The overall goal of the study is to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6881d6a01301fd0b2e032c1cb73e1a13
https://doi.org/10.1007/978-3-030-85914-5_60
https://doi.org/10.1007/978-3-030-85914-5_60
Autor:
Mohamed Kais Msakni, Magnus Bolstad Holm, Peter Schütz, Carl Axel Benjamin Medbøen, Kjetil Fagerholt
Publikováno v:
Algorithms
Volume 13
Issue 11
Volume 13
Issue 11
Here we study a short-sea feeder network design problem based on mother and daughter vessels. The main feature of the studied system is performing transshipment of cargo between mother and daughter vessels at appropriate locations at sea. This operat
Autor:
Elizabeth Lindstad, Mohamed Kais Msakni, Anna Kristine Almestad Aasen, Abeera Akbar, Frank Meisel, Kjetil Fagerholt
Publikováno v:
Operations Research Proceedings ISBN: 9783030484385
OR
OR
There is a strong political focus on moving cargo transportation from trucks to ships to reduce environmental emissions and road congestion. We study how the introduction of a future generation of autonomous ships can be utilized in maritime transpor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2a64e3915de7b805c744f07e5815987e
https://doi.org/10.1007/978-3-030-48439-2_47
https://doi.org/10.1007/978-3-030-48439-2_47
Autor:
Mohamed Kais Msakni, Mohamed Haouari
Publikováno v:
Transportation Research Part C: Emerging Technologies. 90:393-410
The ability of a supplier of liquefied natural gas (LNG) to deliver cargoes at desired times, while effectively managing a fleet of cryogenic vessels can significantly impact its profits. We investigate in this paper an LNG short-term delivery planni
Publikováno v:
Transportation Research Procedia. 30:60-69
This paper studies the Quay Crane Scheduling Problem (QCSP) that aims to find an optimized schedule for Quay Cranes (QCs) to load and unload containers onto and off of vessels. The resulting schedule has to satisfy certain technical requirements incl
New characteristics of optimal solutions for the two-machine flowshop problem with unlimited buffers
The two-machine flowshop problem with unlimited buffers with the objective of minimising the makespan (F2||Cmax) is addressed. Johnson’s algorithm finds optimal solutions (permutations) to this problem, but are not necessarily the only optimal solu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::44a7c80fe427a3a084289a6b0d8280d4
https://hdl.handle.net/10576/14856
https://hdl.handle.net/10576/14856