MAMohammed Al-Salem

Mohammed Al-Salem

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Mohammed Al-Salem has a total of 33 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    A mathematical model and heuristic approaches for runway rescheduling

    by G. Hancerliogullari Koksalmis, G. Rabadi, M. Kharbeche, M. Al-Salem

    This study addresses the Aircraft Reactive Scheduling Problem (ARSP) on multiple parallel runways in response to operational disruptions. We specifically consider three disruptive event types; flight cancelations, delays and unexpected arrivals. Interruptions to aircraft schedules due to various reasons (e.g. bad weather conditions) may render the initial schedule not optimal or infeasible. In this paper, the ARSP is conceptualised as a multi-objective optimisation problem wherein considerations encompass not only the quality of the schedule but also its stability, defined as its conformity to an initial schedule, are of interest. A mixed-integer linear programming (MILP) model is introduced to obtain optimal solutions under different policies. Repair and regeneration heuristic approaches are developed for larger instances for which optimal solutions are time-consuming to obtain. While prevailing literature tends to concentrate on individual disruption types, our investigation diverges by concurrently addressing diverse disruption types through multiple disruptive events. We introduce alternative reactive scheduling methodologies wherein the model autonomously adapts by dynamically choosing from a range of candidate solution methods, considering conflicting objectives related to both quality and stability. A computational study is conducted, and we compare the solutions of heuristics to optimal solutions or the best solution found within a time limit, and their performances are assessed in terms of schedule stability, solution quality and computational time. We compare the solutions of heuristics and optimal solutions (i.e. the best solution found so far), and their performances are assessed in terms of schedule stability, solution quality and computational time.


  • Open Access

    Solar Technology and District Cooling System in a Hot Climate Regions: Optimal Configuration and Technology Selection

    by Rabah Ismaen, Tarek Y. ElMekkawy, Shaligram Pokharel, Adel Elomri, Mohammed Al-Salem

    With the increasing need for cooling and the concerns for pollution due to fossil fuel-based energy use, renewable energy is considered an add-on to cooling technologies. The climatic condition in the Middle East, analyzed in this paper, provides the potential to integrate solar energy with the cooling system. Due to the availability of various solar energy and cooling technologies, multiple configurations of solar-cooling systems can be considered to satisfy the cooling demand. The research presented in this paper aims to assess and compare these configurations by considering the energy prices and the installation area. The proposed model is formulated in Mixed-Integer Linear Programming and optimizes the holistic system design and operation. The economic, renewable energy use, and environmental performances of the optimal solution for each configuration are analyzed and compared to the base grid-DCS configuration. Results show that the electricity tariff and the available installation area impact the economic competitiveness of the solar energy integration. When electricity tariff is subsided (low), the conventional grid-based DCS is the most competitive. The PV-DCS configuration is economically competitive among the solar assisted cooling systems, and it can contribute to reducing the environmental impact by 58.3%. The PVT-DCS configuration has the lowest operation cost and the highest environmental performance by decreasing the global warming potential by 89.5%. The T-DCS configuration becomes economically competitive only at high electricity tariffs.


  • Open Access

    Road Users’ Behavior at Marked Crosswalks on Channelized Right-Turn Lanes at Intersections in the State of Qatar

    by Deepti Muley, Mohamed Kharbeche, Lucy Downey, Wafaa Saleh, Mohammed Al-Salem

    At non-signalized marked crosswalks, pedestrian priority is neither well-defined nor well acknowledged by drivers. This paper presents the findings of an investigation on both driver and pedestrian behavior at non-signalized marked crosswalks located on channelized right-turn lanes at intersections in the State of Qatar. Five crosswalks in Doha city were video recorded from discrete locations on a typical working day. The results from the data analysis of 1620 pedestrians’ behavior indicated that waiting behavior, gap acceptance, and crossing speed are complex phenomena and depend upon both pedestrians’ characteristics as well as their crossing characteristics. The drivers’ yielding behavior was mainly linked to pedestrians’ gender and adjacent land use. Low driver yielding rates indicated that significant improvements are required to enhance pedestrian safety. Among pedestrian attributes, gender had the most significant effect on crossing behavior followed by distractions, crossing in a group or alone, and dressing style. Findings of this research will be useful for planners when designing crosswalks at new intersections and during simulations of pedestrian and driver behavior at marked crosswalks on exclusive right-turn lanes. The results of this study will also be directly applicable to the Arabian Gulf countries as they exhibit similar conditions as the State of Qatar.


  • Empirical Study on Pedestrian Signal Design and Compliance in the State of Qatar

    by Deepti Muley, Mohamed Kharbeche, Wael K. M. Alhajyaseen, Mohammed Al-Salem


  • Exact methods for the quay crane scheduling problem when tasks are modeled at the single container level

    by Mohamed Kais Msakni, Ali Diabat, Ghaith Rabadi, Mohamed Al-Salem, Mariam Kotachi


  • Throughput optimization for the Robotic Cell Problem with Controllable Processing Times

    by Mohammed Al-Salem, Mohamed Kharbeche

    In this paper, we present a MIP-based heuristic and an effective genetic algorithm for the Robotic Cell Problem with Controllable Processing Times (RCPCPT). This problem arises in modern automated manufacturing systems and requires simultaneously scheduling jobs, machines, and transportation devices in order to maximize the throughput or minimize the makespan. The RCPCPT is modeled as a flow shop problem with blocking constraints, a single transport robot, and controllable processing times. This latter feature of the model refers to the fact that the processing times are not fixed but vary linearly with the acceleration cost and therefore should be determined as part of the problem output. We formulate the problem as a nonlinear mixed-integer programming formulation and we use its linearized form to derive LP- and MIP-based heuristics. In addition, we proposed a genetic algorithm consistently yields near-optimal solution and it encompasses several novel features including, an original solution encoding as well as a mutation operator that requires iteratively solving MIPs in order to generate feasible processing times. Finally, we present a computational study for the proposed formulation, heuristics and genetic algorithm and we provide an empirical evidence of the effectiveness of the MIP-based heuristic for small instances and the genetic algorithm for large instances.


  • Open Access

    Heuristic and Exact Algorithms for the Two-Machine Just in Time Job Shop Scheduling Problem

    by Mohammed Al-Salem, Leonardo Bedoya-Valencia, Ghaith Rabadi

    The problem addressed in this paper is the two-machine job shop scheduling problem when the objective is to minimize the total earliness and tardiness from a common due date (CDD) for a set of jobs when their weights equal 1 (unweighted problem). This objective became very significant after the introduction of the Just in Time manufacturing approach. A procedure to determine whether the CDD is restricted or unrestricted is developed and a semirestricted CDD is defined. Algorithms are introduced to find the optimal solution when the CDD is unrestricted and semirestricted. When the CDD is restricted, which is a much harder problem, a heuristic algorithm is proposed to find approximate solutions. Through computational experiments, the heuristic algorithms’ performance is evaluated with problems up to 500 jobs.


  • Gravity Model Extensions for the Impact of Mega Sports Events on Tourist Flow

    by Ghaith Rabadi, A. Sami Stanekzai, T. Steven Cotter, Mohammed H. Al-Salem


  • Minimizing the total completion time in a two-machine flowshop problem with time delays

    by Mohamed Kais Msakni, Wael Khallouli, Mohamed Al-Salem, Talel Ladhari

    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 algorithm based on the branch-and-bound framework is developed, which includes new lower and upper bounds as well as dominance rules. The computational study shows that problems with up to 40 jobs can be solved in a reasonable amount of time.