AbstractThis 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 single server is faced with a collection of jobs of varying duration and urgency. Each job has a r...
We consider a bene t model for on-line preemptive scheduling. In this model jobs arrive at the on-...
We consider the problem of running a job on a selected machine of a collection of machines. Each of ...
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 optimization of CP utilization in a CP-Terminal system with exponential jo...
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...
AbstractThe aim of this paper is to investigate the effect of the different service disciplines, suc...
AbstractThe paper deals with the derivation of optimal control rules for finite source queueing syst...
A class of dynamic control policies is defined for scheduling customers from a Poisson source on a s...
The dynamic optimization proposed in this work uses a linear programming technique to maximize the q...
We consider the problem of minimizing the expected makespan of n jobs with independent exponentially...
Motivated by the patient triage problem in emergency response, we consider a single-server clearing ...
We consider a benet model for on-line preemptive scheduling. In this model jobs arrive at the on-lin...
A single server is faced with a collection of jobs of varying duration and urgency. Each job has a r...
We consider a bene t model for on-line preemptive scheduling. In this model jobs arrive at the on-...
We consider the problem of running a job on a selected machine of a collection of machines. Each of ...
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 optimization of CP utilization in a CP-Terminal system with exponential jo...
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...
AbstractThe aim of this paper is to investigate the effect of the different service disciplines, suc...
AbstractThe paper deals with the derivation of optimal control rules for finite source queueing syst...
A class of dynamic control policies is defined for scheduling customers from a Poisson source on a s...
The dynamic optimization proposed in this work uses a linear programming technique to maximize the q...
We consider the problem of minimizing the expected makespan of n jobs with independent exponentially...
Motivated by the patient triage problem in emergency response, we consider a single-server clearing ...
We consider a benet model for on-line preemptive scheduling. In this model jobs arrive at the on-lin...
A single server is faced with a collection of jobs of varying duration and urgency. Each job has a r...
We consider a bene t model for on-line preemptive scheduling. In this model jobs arrive at the on-...
We consider the problem of running a job on a selected machine of a collection of machines. Each of ...