An optimal policy for joining a queue in processing two kinds of jobs (Q597362): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Regulation of Queue Size by Levying Tolls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Individual versus Social Optimization in the Allocation of Customers to Alternative Servers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality of the shortest line discipline / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5615108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714399 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3321201 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markov programming by successive approximations with respect to weighted supremum norms / rank
 
Normal rank

Latest revision as of 18:03, 6 June 2024

scientific article
Language Label Description Also known as
English
An optimal policy for joining a queue in processing two kinds of jobs
scientific article

    Statements

    An optimal policy for joining a queue in processing two kinds of jobs (English)
    0 references
    0 references
    0 references
    6 August 2004
    0 references
    A customer with two types of jobs arrive at a Poisson arrival and exponential server queue. Job A is processed in one queueing sytem and job B can be processed if he is not in the queueing system. The process of job B consists of several tasks at the end of any task process. At each end of the task process, he makes a decision whether he should suspend the process of job B and join the queue to process job A. If he decides to join the queue, he resumes job B when job A is finished. The authors minimize the expected time until two jobs are completed using a dynamic programming formulation.
    0 references
    dynamic programming
    0 references
    monotone policy
    0 references

    Identifiers