Allocations of Servicing Periods That Minimize Average Delay for N Time-Shared Traffic Streams

R. Rangarajan and R. M. Oliver
Additional contact information
R. Rangarajan: University of California, Berkeley, California
R. M. Oliver: University of California, Berkeley, California

Transportation Science, 1967, vol. 1, issue 2, 74-80

Abstract: In this paper the authors find the optimal allocation of servicing periods to a facility servicing N incoming traffic streams. In our model it is assumed that stream flows are deterministic, that there is a fixed amount of time lost, (tau) i , when the server switches attention from the i th to the i + 1st stream and that the objective is to minimize time average delay.

Date: 1967
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.1.2.74 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:1:y:1967:i:2:p:74-80

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().