Title: | QUEUING SYSTEM WITH IMPATIENT CUSTOMERS - APPLYING SIMULATION TECHNIQUES TO SOLVE A SMALL BUSINESS PROBLEM |
Authors: | Svoboda, Milan Plevný, Miroslav Říhová, Pavla |
Citation: | SVOBODA, M. PLEVNÝ, M. ŘÍHOVÁ, P.Queing systém with impatient customers – applying simulation techniques to solve a small business problem. In: Proceedings of the International Scientific Conference Quantitative Methods in Economics / Multiple Criteria Decision Making XX. Bratislava: Letra Edu, 2020. s. 319-325. ISBN 978-80-89962-60-0. |
Issue Date: | 2020 |
Publisher: | Letra Edu |
Document type: | konferenční příspěvek conferenceObject |
URI: | http://hdl.handle.net/11025/42914 |
ISBN: | 978-80-89962-60-0 |
Keywords in different language: | queuing system;impatience of customers;optimization;simulation methods |
Abstract in different language: | The study deals with an analysis and optimization of a queuing system in the service sector. The company under review is a traditional men’s hairdresser (barber) whose business model is based on limited offer of services (dry hair cut) with the emphasis on short waiting time and no orders in advance. The analyzed queuing system is characterized by impatient customers in the system. The aim of the study is to design an optimal operating system, which will balance the interests of operator (service owner), service staff, and service customers. Random distributions of system input parameters are modeled on the basis of known information about the number of arriving customers and the time of service. The resulting optimal parameter values were obtained by simulation procedure. The simulation was performed by MS Excel using VBA (Visual Basic for Applications). |
Rights: | © Letra Edu |
Appears in Collections: | Konferenční příspěvky / Conference papers (KEM) OBD |
Files in This Item:
File | Size | Format | |
---|---|---|---|
Svoboda_Plevny_Rihova_Zbornik2020.pdf | 984,3 kB | Adobe PDF | View/Open |
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11025/42914
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.