Browsing by Author "Msakni, Mohamed Kais"
Now showing items 1-6 of 6
-
An Integrated Quay Crane Assignment and Scheduling Problem Using Branch-and-Price
Msakni, Mohamed Kais; Al-Salem, Mohammed; Diabat, Ali; Rabadi, Ghaith; Kotachi, Mariam ( Institute of Electrical and Electronics Engineers Inc. , 2017 , Conference)This paper investigates the integrated quay crane assignment and scheduling problem (QCASP). The problem requires determining the assignment of quay cranes to vessels and the scheduling of operations to be performed by ... -
EXACT AND HEURISTIC APPROACHES FOR MAXIMIZING FLOWS IN UAV-ENABLED WIRELESS CELLULAR NETWORKS WITH MULTI-HOP BACKHAULS
Mhiri, Mariem; Msakni, Mohamed Kais; Hasna, Mazen O.; Khattab, Tamer; Haouari, Mohamed ( EDP Sciences , 2024 , Article)This paper investigates the problem of data routing in backhaul networks using Unmanned Aerial Vehicles (UAVs) to relay data from Small Cells (SCs) to the core network. The objective is to maximize the total fulfilled ... -
Flight Scheduling in the Airspace
Msakni, Mohamed Kais; Kharbeche, Mohamed; Al-Salem, Mohammed; Hammuda, Abdelmagid ( Hamad bin Khalifa University Press (HBKU Press) , 2016 , Conference)This paper addresses an important problem in the aircraft traffic management caused by the rapid growth of air traffic. The air route traffic control center has to deal with different plans of airlines in which they specify ... -
Minimizing the total completion time in a two-machine flowshop problem with time delays
Msakni, Mohamed Kais; Khallouli, Wael; Al-Salem, Mohamed; Ladhari, Talel ( Taylor and Francis Ltd. , 2016 , Article)This article proposes to solve the problem of minimizing the total completion time in a two-machine permutation flowshop environment in which time delays between the machines are considered. For this purpose, an enumeration ... -
New characteristics of optimal solutions for the two-machine flowshop problem with unlimited buffers
Rabadi, Ghaith; Msakni, Mohamed Kais; Rodriguez-Velasquez, Elkin; Alvarez-Bermudez, William ( Taylor and Francis Ltd. , 2019 , Article)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 ... -
Optimal planning of liquefied natural gas deliveries
Al-Haidous, Sara; Msakni, Mohamed Kais; Haouari, Mohamed ( Elsevier , 2016 , Article)We investigate the problem of designing an optimal annual delivery plan for Liquefied Natural Gas (LNG). This problem requires determining the long-term cargo delivery dates and the assignment of vessels to the cargoes ...



