Abstract
We consider a Markovian clearing queueing system with setup times. When the system is empty, the server gets into the state of vacation. Once a new customer arrives the system, an exponential setup time is required before the server renders the service again. The customers are accumulated according to Poisson arrival process and the service times are exponentially distributed. Upon their arrivals, customers decide whether to join or balk the queue based on a natural linear reward-cost structure which reflects their desire for service and their unwillingness to wait. According to the state of server under some condition, we obtain the balking strategies of customers, the stationary distribution of system state, the expected queue length and the social optimal benefit. Finally, some numerical experiments describe how the expected queue length and the social optimal benefit depend on the arrival rate, the service time and the setup time.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
