Mohamed Kais Msakni

Orcid: 0000-0003-3060-6970

According to our database1, Mohamed Kais Msakni authored at least 13 papers between 2010 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Exact and heuristic approaches for maximizing flows in UAV-enabled wireless cellular networks with multi-hop backhauls.
RAIRO Oper. Res., January, 2024

2023
Using machine learning prediction models for quality control: a case study from the automotive industry.
Comput. Manag. Sci., December, 2023

2021
An economic analysis of introducing autonomous ships in a short-sea liner shipping network.
Int. Trans. Oper. Res., 2021

A Neural Network Model for Quality Prediction in the Automotive Industry.
Proceedings of the Advances in Production Management Systems. Artificial Intelligence for Sustainable and Resilient Production Systems, 2021

2020
Combining Optimization and Simulation for Designing a Robust Short-Sea Feeder Network.
Algorithms, 2020

2019
New characteristics of optimal solutions for the two-machine flowshop problem with unlimited buffers.
J. Oper. Res. Soc., 2019

Can Autonomous Ships Help Short-Sea Shipping Become More Cost-Efficient?
Proceedings of the Operations Research Proceedings 2019, 2019

2018
Exact methods for the quay crane scheduling problem when tasks are modeled at the single container level.
Comput. Oper. Res., 2018

2016
A comprehensive annual delivery program for upstream liquefied natural gas supply chain.
Eur. J. Oper. Res., 2016

A discrete event simulation for the logistics of Hamad's container terminal of Qatar.
Proceedings of the Winter Simulation Conference, 2016

2013
The two-machine flowshop scheduling problem with sequence-independent setup times: New lower bounding strategies.
Eur. J. Oper. Res., 2013

2012
Minimizing the total completion time in a two-machine flowshop with sequence-independent setup times.
J. Oper. Res. Soc., 2012

2010
Polynomial Lower Bounds for the Two-Machine Flowshop Problem with Sequence-Independent Setup Times.
Electron. Notes Discret. Math., 2010


  Loading...