Skip to main content


eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item:
Title: Price Scheduling in a Time-Sharing Queueing System
Authors: Babad, Jair Moshe
Keywords: computer science
technical report
Issue Date: Aug-1973
Publisher: Cornell University
Abstract: This thesis deals with a time-sharing system in which users may join after paying an appropriate toll and are subjected to service and waiting charges. The form of an optimal joining policy that minimizes the expected loss of users who may join the system at some of its queues is derived, and is shown to be a control-limit policy with a single control number for every possible entry queue; a newly arriving user will join the minimal-priority entry queue that is not filled up to its contrl number. Tolls and charges that maximize the average expected revenue of the system, as well as the control numbers, are determined for a round-robin time-sharing system. A multi-entrance foreground-background time-sharing system with random entrance is analyzed and the characteristics of the system, such as expected waiting times and expected number of waiting users in each queue, are given. It is shown that when the entry into this system is based on tolls and charges, there exists a set of prices (and associated control numbers) that maximizes the discounted expected revenues of the system.
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
73-178.pdf7.59 MBAdobe PDFView/Open
73-178.ps1.85 MBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.


© 2014 Cornell University Library Contact Us