Control of arrivals in a finite buffered queue with setup costs

Control of arrivals in a finite buffered queue with setup costs

0.00 Avg rating0 Votes
Article ID: iaor1999981
Country: United Kingdom
Volume: 48
Issue: 11
Start Page Number: 1113
End Page Number: 1122
Publication Date: Nov 1997
Journal: Journal of the Operational Research Society
Authors: ,
Abstract:

We consider finite buffered queues where the arrival process is controlled by shutting down and restarting the arrival stream. In the absence of holding costs for items in the queue, the optimal (s, S) policy can be characterised by relating the arrival control problem to a corresponding service control problem. With the inclusion of holding costs however, this characterisation is not valid and efficient numerical computation of the queue length probability distribution is necessary. We perform this computation by using a duality property which relates queue lengths in the controlled arrival system to a controlled service system. Numerical results which analyse the effect of setup and holding costs and the variability of the arrival process on the performance of the system are included.

Reviews

Required fields are marked *. Your email address will not be published.