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

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 2082665
Language Label Description Also known as
default for all languages
No label defined
    English
    An optimal policy for joining a queue in processing two kinds of jobs
    scientific article; zbMATH DE number 2082665

      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