An M/M/1 dynamic priority queue with optional promotion
Bookreader Item Preview
Share or Embed This Item
texts
An M/M/1 dynamic priority queue with optional promotion
- by
- Kofman, Ehud, 1945-; Lippman, Steven A. joint author; University of Illinois at Urbana-Champaign. College of Commerce and Business Administration
- Publication date
- 1978
- Topics
- Queuing theory, Customer services
- Publisher
- [Urbana, Ill.] : College of Commerce and Business Administration, University of Illinois at Urbana-Champaign
- Collection
- university_of_illinois_urbana-champaign; americana
- Contributor
- University of Illinois Urbana-Champaign
- Language
- English
- Volume
- BEBR No. 524
"This research was partially supported by the National Science Foundation through Grant SOC-7808985."
Includes bibliographical references (p. 29-30)
"We consider an M/M/1 queue with two types of customers: priority customers and regular customers. They arrive at the service facility according to two independent Poisson streams and form a single queue according to the order in which they arrive. The two types of customers are distinguished by the holding costs charged per unit time that each of them resides in the queue. The server can either serve customers according to the order in which they arrive or pay a fixed fee R and promote a priority customer, bypassing the customers ahead of him. The server selects the customers to be served so as to minimize the expected average cost per unit of time of operating the system. We show that whenever the number of regular customers bypassed in a promotion times the expected holding costs per priority customer per service period is greather than or equal to R, promotion is strictly optimal. Moreover, for each state there exists a value of R, with R exceeding the number of regular customers bypassed in a promotion times the expected holding costs per priority customer per service period, for which promotion is optimal. This result contradicts previous work in the literature. In addition, we demonstrate that the set of states from which promotion is optimal decreases in the sense of set inclusion as R increases. This fact is the key to an efficient algorithm."
Includes bibliographical references (p. 29-30)
"We consider an M/M/1 queue with two types of customers: priority customers and regular customers. They arrive at the service facility according to two independent Poisson streams and form a single queue according to the order in which they arrive. The two types of customers are distinguished by the holding costs charged per unit time that each of them resides in the queue. The server can either serve customers according to the order in which they arrive or pay a fixed fee R and promote a priority customer, bypassing the customers ahead of him. The server selects the customers to be served so as to minimize the expected average cost per unit of time of operating the system. We show that whenever the number of regular customers bypassed in a promotion times the expected holding costs per priority customer per service period is greather than or equal to R, promotion is strictly optimal. Moreover, for each state there exists a value of R, with R exceeding the number of regular customers bypassed in a promotion times the expected holding costs per priority customer per service period, for which promotion is optimal. This result contradicts previous work in the literature. In addition, we demonstrate that the set of states from which promotion is optimal decreases in the sense of set inclusion as R increases. This fact is the key to an efficient algorithm."
Notes
-The text was faintly printed and irregularly faded throughout the book. In some cases, it was almost illegible.
-The text ran out to the farthest edges of the pages; the crop-boxes were adjusted as best as possible to accommodate. In some cases, bits of the text were lost.
- Addeddate
- 2011-04-05 14:29:23
- Associated-names
- Lippman, Steven A. joint author; University of Illinois at Urbana-Champaign. College of Commerce and Business Administration
- Bookplateleaf
- 0003
- Call number
- 91602
- Camera
- Canon 5D
- External-identifier
- urn:oclc:record:1049648834
- Foldoutcount
- 0
- Identifier
- mm1dynamicpriori524kofm
- Identifier-ark
- ark:/13960/t90874b38
- Ocr_converted
- abbyy-to-hocr 1.1.37
- Ocr_module_version
- 0.0.21
- Openlibrary_edition
- OL24980438M
- Openlibrary_work
- OL15712011W
- Page-progression
- lr
- Page_number_confidence
- 0
- Page_number_module_version
- 1.0.3
- Pages
- 46
- Possible copyright status
- In copyright. Digitized with permission of the University of Illinois Board of Trustees. Contact digicc@library.illinois.edu for information.
- Ppi
- 300
- Scandate
- 20110421141242
- Scanner
- scribe1.il.archive.org
- Scanningcenter
- il
- Worldcat (source edition)
- 5121031
- Full catalog record
- MARCXML
comment
Reviews
There are no reviews yet. Be the first one to
write a review.
305 Views
DOWNLOAD OPTIONS
For users with print-disabilities
IN COLLECTIONS
University of Illinois Urbana-Champaign American LibrariesUploaded by TriciaD-loader on