View in EDS PDF Full Text

Control policy of a hysteretic queueing system.

Saved in:
Bibliographic Details
Title: Control policy of a hysteretic queueing system.
Authors: Tadj, Lotfi, Ke, Jau-Chuan
Source: Mathematical Methods of Operations Research. 2003, Vol. 57 Issue 3, p367. 10p.
Subjects: Queuing theory, Control theory (Engineering), Markov processes, Operations research, Mathematics
Abstract: This paper is concerned with the optimal control of a bulk service queueing system under N-policy. If the number of customers in the system at a service completion is larger than some integer r, then the server starts processing a group of r customers. If, on the other hand, it is smaller than r, then the server goes through an idle period and waits for the line to grow up to some integer N (N ≥ r). We present some system characteristics by means of the embedded Markov chains and semi-regenerative techniques. We also construct the expected total cost for this model and develop a procedure to determine the optimal thresholds r and N that yield the minimum cost. [ABSTRACT FROM AUTHOR]
Copyright of Mathematical Methods of Operations Research is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 10241701
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Control policy of a hysteretic queueing system.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Tadj%2C+Lotfi%22">Tadj, Lotfi</searchLink><br /><searchLink fieldCode="AR" term="%22Ke%2C+Jau-Chuan%22">Ke, Jau-Chuan</searchLink>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Mathematical+Methods+of+Operations+Research%22">Mathematical Methods of Operations Research</searchLink>. 2003, Vol. 57 Issue 3, p367. 10p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Queuing+theory%22">Queuing theory</searchLink><br /><searchLink fieldCode="DE" term="%22Control+theory+%28Engineering%29%22">Control theory (Engineering)</searchLink><br /><searchLink fieldCode="DE" term="%22Markov+processes%22">Markov processes</searchLink><br /><searchLink fieldCode="DE" term="%22Operations+research%22">Operations research</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematics%22">Mathematics</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: This paper is concerned with the optimal control of a bulk service queueing system under N-policy. If the number of customers in the system at a service completion is larger than some integer r, then the server starts processing a group of r customers. If, on the other hand, it is smaller than r, then the server goes through an idle period and waits for the line to grow up to some integer N (N ≥ r). We present some system characteristics by means of the embedded Markov chains and semi-regenerative techniques. We also construct the expected total cost for this model and develop a procedure to determine the optimal thresholds r and N that yield the minimum cost. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Mathematical Methods of Operations Research is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=10241701
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/s001860200264
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 10
        StartPage: 367
    Subjects:
      – SubjectFull: Queuing theory
        Type: general
      – SubjectFull: Control theory (Engineering)
        Type: general
      – SubjectFull: Markov processes
        Type: general
      – SubjectFull: Operations research
        Type: general
      – SubjectFull: Mathematics
        Type: general
    Titles:
      – TitleFull: Control policy of a hysteretic queueing system.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Tadj, Lotfi
      – PersonEntity:
          Name:
            NameFull: Ke, Jau-Chuan
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 08
              Text: 2003
              Type: published
              Y: 2003
          Identifiers:
            – Type: issn-print
              Value: 14322994
          Numbering:
            – Type: volume
              Value: 57
            – Type: issue
              Value: 3
          Titles:
            – TitleFull: Mathematical Methods of Operations Research
              Type: main
ResultId 1