Article ID Journal Published Year Pages File Type
5128442 Operations Research Letters 2017 6 Pages PDF
Abstract

We find the optimal policy for the information disclosure problem of the M/M/1 queue studied by Simhon et al. (2016). Our optimal disclosure policy is as follows: the service provider informs all customers of the queue length when the queue length is above a specified threshold and does not inform them when the queue length is below the threshold.

Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Authors
, ,