An optimal solution for the budgets assignment problem

Jemmali, Mahdi

doi:10.1051/ro/2021043

Cited by 19 publications

(12 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recently, the author of (Jemmali, 2021) developed an optimal solution for the budget assignment problem. Several lower bounds and upper bounds were developed in the latter research work to be used in the branch and bound algorithm.…”

Section: Adcaij: Advances In Distributed Computingmentioning

confidence: 99%

Projects Distribution Algorithms for Regional Development

Jemmali

2021

ADCAIJ

Self Cite

View full text Add to dashboard Cite

This paper aims to find an efficient method to assign different projects to several regions seeking an equitable distribution of the expected revenue of projects. The solutions to this problem are discussed in this paper. This problem is NP-hard. For this work, the constraint is to suppose that all regions have the same socio-economic proprieties. Given a set of regions and a set of projects. Each project is expected to elaborate a fixed revenue. The goal of this paper is to minimize the summation of the total difference between the total revenues of each region and the minimum total revenue assigned to regions. An appropriate schedule of projects is the schedule that ensures an equitable distribution of the total revenues between regions. In this paper, we give a mathematical formulation of the objective function and propose several algorithms to solve the studied problem. An experimental result is presented to discuss the comparison between all implemented algorithms.

show abstract

Section: Adcaij: Advances In Distributed Computingmentioning

confidence: 99%

Projects Distribution Algorithms for Regional Development

Jemmali

2021

ADCAIJ

Self Cite

View full text Add to dashboard Cite

show abstract

“…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

“…While mathematical modeling of load balancing with a new proposed objective function that determines the indicator to select among the proposed heuristics was presented by Jemmali (2019b , 2021c ). In the same context, the exact solution of the load balancing problem applied on the distribution of projects was presented in Alharbi & Jemmali (2020) and Jemmali (2021b) . The machine-learning technique (decision tree) and the application of particle swarm optimization (PSO) presented by Bany Taha et al (2020) can be utilized to extend some meta-heuristics for the load balancing problem.…”

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

An optimal solution for the budgets assignment problem

Cited by 19 publications

References 21 publications

Projects Distribution Algorithms for Regional Development

Projects Distribution Algorithms for Regional Development

Algorithms for Pre-Compiling Programs by Parallel Compilers

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

Contact Info

Product

Resources

About