Randomized-Variants Lower Bounds for Gas Turbines Aircraft Engines

Jemmali, Mahdi; Melhim, Loai Kayed B.; Alharbi, Mafawez

doi:10.1007/978-3-030-21803-4_94

Cited by 12 publications

(6 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Several authors treated the fair load balancing into computer [17][18][19]. Other domains that others treated the load blanching are the projects assignment and gas turbines aircraft engines [20][21][22][23][24][25]. Recently, a novel research work to fight COVID-19 using load balancing algorithm is developed in [26].…”

Section: Introductionmentioning

confidence: 99%

Algorithms for Pre-Compiling Programs by Parallel Compilers

Alfayez¹

2023

Computer Systems Science and Engineering

View full text Add to dashboard Cite

The paper addresses the challenge of transmitting a big number of files stored in a data center (DC), encrypting them by compilers, and sending them through a network at an acceptable time. Face to the big number of files, only one compiler may not be sufficient to encrypt data in an acceptable time. In this paper, we consider the problem of several compilers and the objective is to find an algorithm that can give an efficient schedule for the given files to be compiled by the compilers. The main objective of the work is to minimize the gap in the total size of assigned files between compilers. This minimization ensures the fair distribution of files to different compilers. This problem is considered to be a very hard problem. This paper presents two research axes. The first axis is related to architecture. We propose a novel pre-compiler architecture in this context. The second axis is algorithmic development. We develop six algorithms to solve the problem, in this context. These algorithms are based on the dispatching rules method, decomposition method, and an iterative approach. These algorithms give approximate solutions for the studied problem. An experimental result is implemented to show the performance of algorithms. Several indicators are used to measure the performance of the proposed algorithms. In addition, five classes are proposed to test the algorithms with a total of 2350 instances. A comparison between the proposed algorithms is presented in different tables discussed to show the performance of each algorithm. The result showed that the best algorithm is the Iterative-mixed Smallest-Longest-Heuristic (ISL) with a percentage equal to 97.7% and an average running time equal to 0.148 s. All other algorithms did not exceed 22% as a percentage. The best algorithm excluding ISL is Iterative-mixed Longest-Smallest Heuristic (ILS) with a percentage equal to 21,4% and an average running time equal to 0.150 s.

show abstract

Section: Introductionmentioning

confidence: 99%

Algorithms for Pre-Compiling Programs by Parallel Compilers

Alfayez¹

2023

Computer Systems Science and Engineering

View full text Add to dashboard Cite

show abstract

“…The importance of load balancing emerged through the different areas that utilized this concept. Load balancing algorithms were presented for the aviation sector to be applied for gas turbines engine in Jemmali et al (2019) and Jemmali, Melhim & Alharbi (2019) . Recently, Alquhayz, Jemmali & Otoom (2020) utilized load balancing to present solutions for the dispatching files to different disc spaces.…”

Section: Introductionmentioning

confidence: 99%

Equity distribution of quality evaluation reports to doctors in health care organizations

Jemmali

Melhim

Alourani

et al. 2022

PeerJ Computer Science

Self Cite

View full text Add to dashboard Cite

There are volumes of patient reports generated in any healthcare organization daily. The reports can be very lengthy or of few pages. Maintaining records of patients is essential for ensuring quality medical care. Doctors, apart from their routine activities, are also responsible to sort, examine and archive the generated reports. However, this process consumes doctors’ time, who are already hard-pressed for time. The objective of this study is to search for a method that can assign reports to doctors to ensure equitable and fair distribution of the overall workload. As a part of the solution, a mathematical model will be proposed to perform different developed heuristics. An experimental evaluation using different classes with a total of 2,450 different instances will be tested to measure the performance of the developed heuristics in terms of, elapsed time and gap value calculations. The clustering heuristics which is based on two groups is the best heuristic with 96.1% for the small instances and 98% for the big scale instances. The contribution of this work is based on employing dispatching rules with several variants; randomization approach, clustering methods; probabilistic method, and iterative methods approach to assign all given reports to doctors while ensuring the equitable distribution of the paper workload.

show abstract

“…Other domain to apply the equity distribution proposed in latter works is the gas turbines aircraft engines where authors in [13] proposed a mathematical modelling of the problem and two algorithms to solve approximately the problem. Other work related to gas turbines is developed in [14]. Author in [2] developed heuristics for the equity distribution of used space in storage supports.…”

Section: Introductionmentioning

confidence: 99%

An optimal solution for the budgets assignment problem

Jemmali

2021

RAIRO-Oper. Res.

Self Cite

View full text Add to dashboard Cite

Municipalities are service organizations that have a major role in strategic planning and community development that consider the future changes and society developments, by implementing set of projects with pre-allocated budgets. Projects have standards, budgets and constraints that differ from one community to another and from one city to another. Fair distributing of different projects to municipalities, while ensuring the provision of various capabilities to reach developmental role is NP-Hard problem. Assuming that all municipalities have the same strategic characteristics. The problem is as follows: given a set of projects with different budgets, how to distribute all projects to all municipalities with a minimum budget gap between municipalities. To derive equity distribution between municipalities, this paper developed lower bounds and eleven heuristics to be utilized in the branch-and-bound algorithms. The performance of the developed heuristics, lower bounds and the exact solutions are presented in the experimental study.

show abstract

Randomized-Variants Lower Bounds for Gas Turbines Aircraft Engines

Cited by 12 publications

References 4 publications

Algorithms for Pre-Compiling Programs by Parallel Compilers

Algorithms for Pre-Compiling Programs by Parallel Compilers

Equity distribution of quality evaluation reports to doctors in health care organizations

An optimal solution for the budgets assignment problem

Contact Info

Product

Resources

About