Max-Min Probabilistic Algorithms for Parallel Machines

Trains have a key role in transporting people and goods with the option of moving from source to destinations by passing through several stations, with time-based features like date scheduling and known arrival times, which makes time a critical factor. The main challenge here, is to ensure that the train trip or train schedules are not affected or delayed in any way during the whole train trip; by giving the control unit in the railway system, the required time to process requests regarding all collected data. This an NP-hard problem with an optimal solution of handling all collected data and all service requests by the control unit of the railway system. Operational research will be used to solve this problem by developing many heuristics to deal with tasks of real-time systems, to produce a significant time optimization in the railway systems. To solve this problem, the proposed approach employs optimization by adapting 22 heuristics based on two categories of algorithms, the separated blocks category algorithm and the blocks interference category algorithm. The proposed approach receives data from many different sources at the same time, then collects the received data and save it to a data base in the railway system control unit. Experimental results showed the effectiveness of the developed heuristics, more over the proposed approach minimized the maximum completion time that was elapsed in handling the received requests.

show abstract

“…The algorithms used in several different scheduling problems can be utilized to expand and enhance the studied problem [1,5,7,20,22,23,27,28].…”

Section: Related Studiesmentioning

confidence: 99%

Real time read-frequency optimization for railway monitoring system

2022

Self Cite

View full text Add to dashboard Cite

show abstract

“…The proposed algorithms can be applied to enhance the monitoring system developed by ( Melhim et al, 2020 ; Melhim, Jemmali & Alharbi, 2019 ). On the other hand, the algorithms developed by Jemmali (2019a) ; Jemmali (2019b) ; Jemmali (2022) ; Alharbi & Jemmali (2020) ; Jemmali (2021a) ; Jemmali (2021b) ; Jemmali, Otoom & Al Fayez (2020) ; Jemmali, Melhim & Al Fayez (2022) can be enhanced then applied to address the proposed problem. Our solution suggests enhancing the current IP network architecture by providing multilevel data security and privacy protection.…”

Section: Introductionmentioning

confidence: 99%

A novel smart multilevel security approach for secure data outsourcing in crisis

Sarhan

2023

PeerJ Computer Science

View full text Add to dashboard Cite

The Interconnected Network or the Internet has revolutionized digital communications. It has expanded worldwide over the past four decades due to numerous features such as connectivity, transparency, hierarchy, and openness. Several drawbacks, including mobility, scalability, controllability, security, etc., have been presented due to continuous developments. Although several network paradigms exist to address such drawbacks, many issues still persist. This research proposed a future network paradigm that addresses multilevel security shortcomings. It suggested the following: (i) a two-router network-based cyber security architecture for multilevel data sharing; (ii) using a scheduler to deal with the multilevel transmitted packets scheduling problem; (iii) five algorithms for the studied difficult problem; and (iv) providing an experimental result to show the optimal results obtained by the developed algorithms and comparing it with algorithms in the literature. The experimental result shows that the random-grouped classification with shortest scheduling algorithm (RGS) performed the best at 37.7% with a gap of 0.03. This result proves the practicality of our approach in terms of two-machine scheduling problems.

show abstract

“…Recently, a novel research work to fight COVID-19 using load balancing algorithm is developed in [26]. Other works treated the scheduling algorithms and the load balancing are [27,28].…”

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

Max-Min Probabilistic Algorithms for Parallel Machines

Cited by 8 publications

References 1 publication

Real time read-frequency optimization for railway monitoring system

Real time read-frequency optimization for railway monitoring system

A novel smart multilevel security approach for secure data outsourcing in crisis

Algorithms for Pre-Compiling Programs by Parallel Compilers

Contact Info

Product

Resources

About