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.

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.

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.

Residence time distributions and reaction kinetics in a fuel cell anode

1971 ◽  
Vol 1 (3) ◽  
pp. 219-230 ◽  
Author(s):  
M. Duduković ◽  
H. Weinstein ◽  
D. Y. C. Ng
Keyword(s):  
Fuel Cell ◽  
Reaction Kinetics ◽  
Residence Time ◽  
Residence Time Distributions ◽  
Cell Anode ◽  
Fuel Cell Anode

scholarly journals A new approach to constrained state estimation for discrete-time linear systems with unknown inputs

2017 ◽  
Vol 28 (1) ◽  
pp. 326-341 ◽  
Author(s):  
Jose Fernando Garcia Tirado ◽  
Alejandro Marquez-Ruiz ◽  
Hector Botero Castro ◽  
Fabiola Angulo
Keyword(s):  
State Estimation ◽  
Linear Systems ◽  
Discrete Time ◽  
New Approach ◽  
Unknown Inputs ◽  
Time Linear

DEBUGGING PROCESS-ORIENTED DISCRETE SOFTWARE RELIABILITY MODELING

2009 ◽  
Vol 16 (04) ◽  
pp. 357-370 ◽  
Author(s):  
SHINJI INOUE ◽  
NAOKI IWAMOTO ◽  
SHIGERU YAMADA
Keyword(s):  
Discrete Time ◽  
Software Reliability ◽  
Goodness Of Fit ◽  
Growth Models ◽  
Reliability Growth ◽  
Reliability Modeling ◽  
New Approach ◽  
Time Modeling ◽  
Software Reliability Growth ◽  
Discrete Time Modeling

This paper discusses an new approach for discrete-time software reliability growth modeling based on an discrete-time infinite server queueing model, which describes a debugging process in a testing phase. Our approach enables us to develop discrete-time software reliability growth models (SRGMs) which could not be developed under conventional discrete-time modeling approaches. This paper also discuss goodness-of-fit comparisons of our discrete-time SRGMs with conventional continuous-time SRGMs in terms of the criterion of the mean squared errors, and show numerical examples for software reliability analysis of our models by using actual data.

Residence time distributions in SX–EW equipment

1998 ◽  
Vol 54 (3-4) ◽  
pp. 235-242 ◽  
Author(s):  
Hossein Aminian ◽  
Claude Bazin ◽  
Daniel Hodouin
Keyword(s):  
Residence Time ◽  
Residence Time Distributions
Sign in / Sign up

Export Citation Format

Share Document