Add to ORKGThis paper deals with the optimization of CP utilization in a CP-Terminal system with exponential job sizes and exponential think times. It is shown that if preemptions of the resume type are allowed the best static priority rule is to give priority to the fastest thinker and is independent of the expected job size
A class of dynamic control policies is defined for scheduling customers from a Poisson source on a s...
The Shortest Job First algorithm gives the optimal average turnaround time for a set of processes, b...
Motivated by issues raised from data broadcast and networks using ATM and TCP/IP, we consider an onl...
This paper deals with the optimization of CP utilization in a CP-Terminal system with exponential jo...
AbstractThis paper deals with the optimization of CP utilization in a CP-Terminal system with expone...
This paper deals with the CP utilization in a CP-Terminal system with exponential job sizes and expo...
This paper considers a closed queueing network model for the case of a number of different terminals...
We consider a bene t model for on-line preemptive scheduling. In this model jobs arrive at the on-...
We consider a benet model for on-line preemptive scheduling. In this model jobs arrive at the on-lin...
This paper deals with the analysis of a queueing system which may be used as a model for a computer ...
The dynamic optimization proposed in this work uses a linear programming technique to maximize the q...
International audienceWe deal in this paper with the existence of optimal priority assignment for pe...
AbstractThe aim of this paper is to investigate the effect of the different service disciplines, suc...
We consider the problem of minimizing the expected makespan of n jobs with independent exponentially...
A central issue for verifying the schedulability of hard real-time systems is the correct evaluation...
A class of dynamic control policies is defined for scheduling customers from a Poisson source on a s...
The Shortest Job First algorithm gives the optimal average turnaround time for a set of processes, b...
Motivated by issues raised from data broadcast and networks using ATM and TCP/IP, we consider an onl...
This paper deals with the optimization of CP utilization in a CP-Terminal system with exponential jo...
AbstractThis paper deals with the optimization of CP utilization in a CP-Terminal system with expone...
This paper deals with the CP utilization in a CP-Terminal system with exponential job sizes and expo...
This paper considers a closed queueing network model for the case of a number of different terminals...
We consider a bene t model for on-line preemptive scheduling. In this model jobs arrive at the on-...
We consider a benet model for on-line preemptive scheduling. In this model jobs arrive at the on-lin...
This paper deals with the analysis of a queueing system which may be used as a model for a computer ...
The dynamic optimization proposed in this work uses a linear programming technique to maximize the q...
International audienceWe deal in this paper with the existence of optimal priority assignment for pe...
AbstractThe aim of this paper is to investigate the effect of the different service disciplines, suc...
We consider the problem of minimizing the expected makespan of n jobs with independent exponentially...
A central issue for verifying the schedulability of hard real-time systems is the correct evaluation...
A class of dynamic control policies is defined for scheduling customers from a Poisson source on a s...
The Shortest Job First algorithm gives the optimal average turnaround time for a set of processes, b...
Motivated by issues raised from data broadcast and networks using ATM and TCP/IP, we consider an onl...