Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
76
Voted
ORL
2006
55
views
more
ORL 2006
»
Who should be given priority in a queue?
15 years 2 months ago
Download
www.math.tau.ac.il
We consider a memoryless single server queue with two classes of customers, each having its fixed entry fee. We show that profit and social welfare may benefit from a service discipline based on relative priorities.
Refael Hassin, Moshe Haviv
Real-time Traffic
Fixed Entry Fee
|
ORL 2006
|
Relative Priorities
|
Single Server Queue
|
claim paper
Related Content
»
Building Incentives into Tor
»
Lessons Learned in Using Social Media for Disaster Relief ASU Crisis Response Game
more »
Post Info
More Details (n/a)
Added
14 Dec 2010
Updated
14 Dec 2010
Type
Journal
Year
2006
Where
ORL
Authors
Refael Hassin, Moshe Haviv
Comments
(0)
Researcher Info
ORL 1998 Study Group
Computer Vision