New approach of classification for the competence of spectrochemical analysis laboratories based on obtained results in a Round Robin scheme

2008 ◽  
Author(s):  
I. Pencea ◽  
C. E. Sfat ◽  
Mariana Pencea ◽  
Angela Gheorghe ◽  
M.D. Martinov ◽  
...  
Keyword(s):  
Round Robin ◽  
Spectrochemical Analysis ◽  
New Approach

A new approach based on graph matching and evolutionary approach for sport scheduling problem

2020 ◽  
pp. 1-16
Author(s):  
Meriem Khelifa ◽  
Dalila Boughaci ◽  
Esma Aïmeur
Keyword(s):  
Graph Matching ◽  
State Of The Art ◽  
Travel Cost ◽  
Round Robin ◽  
New Approach ◽  
Traveling Tournament Problem ◽  
Significant Interest ◽  
National League ◽  
Better Than

The Traveling Tournament Problem (TTP) is concerned with finding a double round-robin tournament schedule that minimizes the total distances traveled by the teams. It has attracted significant interest recently since a favorable TTP schedule can result in significant savings for the league. This paper proposes an original evolutionary algorithm for TTP. We first propose a quick and effective constructive algorithm to construct a Double Round Robin Tournament (DRRT) schedule with low travel cost. We then describe an enhanced genetic algorithm with a new crossover operator to improve the travel cost of the generated schedules. A new heuristic for ordering efficiently the scheduled rounds is also proposed. The latter leads to significant enhancement in the quality of the schedules. The overall method is evaluated on publicly available standard benchmarks and compared with other techniques for TTP and UTTP (Unconstrained Traveling Tournament Problem). The computational experiment shows that the proposed approach could build very good solutions comparable to other state-of-the-art approaches or better than the current best solutions on UTTP. Further, our method provides new valuable solutions to some unsolved UTTP instances and outperforms prior methods for all US National League (NL) instances.

A new approach to the M/G/1 processor-sharing queue

1984 ◽  
Vol 16 (1) ◽  
pp. 202-213 ◽  
Author(s):  
R. Schassberger
Keyword(s):  
Residence Time ◽  
Discrete Time ◽  
Round Robin ◽  
Processor Sharing ◽  
New Approach ◽  
Approximating Sequence ◽  
Residence Time Distributions

The M/G/1 processor-sharing queue is studied by way of an approximating sequence of models featuring a round-robin discipline and operating in discrete time. In particular, residence-time distributions of jobs are derived.

The round robin site assessment method: A new approach to wind energy site assessment

2008 ◽  
Vol 33 (9) ◽  
pp. 2019-2026 ◽  
Author(s):  
Matthew A. Lackner ◽  
Anthony L. Rogers ◽  
James F. Manwell
Keyword(s):  
Wind Energy ◽  
Assessment Method ◽  
Round Robin ◽  
Site Assessment ◽  
New Approach

scholarly journals Priority based round robin (PBRR) CPU scheduling algorithm

2019 ◽  
Vol 9 (1) ◽  
pp. 190
Author(s):  
Sonia Zouaoui ◽  
Lotfi Boussaid ◽  
Abdellatif Mtibaa
Keyword(s):  
Operating System ◽  
Real Time ◽  
Waiting Time ◽  
Scheduling Algorithm ◽  
Scheduling Algorithms ◽  
Turnaround Time ◽  
Round Robin ◽  
New Approach ◽  
Real Time Operating System ◽  
Cpu Scheduling

<p>This paper introduce a new approach for scheduling algorithms which aim to improve real time operating system CPU performance. This new approach of CPU Scheduling algorithm is based on the combination of round-robin (RR) and Priority based (PB) scheduling algorithms. This solution maintains the advantage of simple round robin scheduling algorithm, which is reducing starvation and integrates the advantage of priority scheduling. The proposed algorithm implements the concept of time quantum and assigning as well priority index to the processes. Existing round robin CPU scheduling algorithm cannot be dedicated to real time operating system due to their large waiting time, large response time, large turnaround time and less throughput. This new algorithm improves all the drawbacks of round robin CPU scheduling algorithm. In addition, this paper presents analysis comparing proposed algorithm with existing round robin scheduling algorithm focusing on average waiting time and average turnaround time.</p>

scholarly journals Dynamic Task Scheduling based on Burst Time Requirement for Cloud Environment

2021 ◽  
Vol 13 (5) ◽  
pp. 75-87
Author(s):  
Linz Tom ◽  
Bindu V.R.
Keyword(s):  
Task Scheduling ◽  
Optimal Solution ◽  
Round Robin ◽  
Cloud Environment ◽  
New Approach ◽  
Cloud Systems ◽  
Dynamic Task ◽  
Overall Performance ◽  
User Tasks ◽  
Burst Time

Cloud computing has an indispensable role in the modern digital scenario. The fundamental challenge of cloud systems is to accommodate user requirements which keep on varying. This dynamic cloud environment demands the necessity of complex algorithms to resolve the trouble of task allotment. The overall performance of cloud systems is rooted in the efficiency of task scheduling algorithms. The dynamic property of cloud systems makes it challenging to find an optimal solution satisfying all the evaluation metrics. The new approach is formulated on the Round Robin and the Shortest Job First algorithms. The Round Robin method reduces starvation, and the Shortest Job First decreases the average waiting time. In this work, the advantages of both algorithms are incorporated to improve the makespan of user tasks.

A new approach to the M/G/1 processor-sharing queue

1984 ◽  
Vol 16 (01) ◽  
pp. 202-213 ◽  
Author(s):  
R. Schassberger
Keyword(s):  
Residence Time ◽  
Discrete Time ◽  
Round Robin ◽  
Processor Sharing ◽  
New Approach ◽  
Approximating Sequence ◽  
Residence Time Distributions

The M/G/1 processor-sharing queue is studied by way of an approximating sequence of models featuring a round-robin discipline and operating in discrete time. In particular, residence-time distributions of jobs are derived.

Sign in / Sign up

Export Citation Format

Share Document