• Journal of Korean Institute of Industrial Engineers
• /
• v.12 no.1
• /
• pp.63-71
• /
• 1986

In the organization with a hierarchical network queue structure a production function is derived whose input factors are the numbers of servers at nodes and output is the number of served customers. Its useful properties are investigated. Using this production function, the contributions of servers to the number of served customers are studied. Also given an expected waiting time in the system for each customer, the optimal numbers of servers at nodes are obtained minimizing a cost function.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.20 no.2
• /
• pp.1-10
• /
• 1995

In this study, a threshold policy is considered for the M/M/2 queueing system with server vacations. The probability generating function for the number of customers present in the system is derived using an embedded Markov chain approach. Then, assuming a linear cost structure, an efficient procedure to find an optimal threshold policy is presented. The Laplace-Stieltjes transofrm for th waiting time of an arbitrary customer under a "FIFO" discipline is also derived.o derived.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.4 no.1
• /
• pp.51-67
• /
• 1979

This paper considers the problem of determining an optimal dynamic operating policy for a two-stage tandem queueing service system in which the service facilities (or stages) can be operated at more than one service rate. At each period of the system's operation, the system manager must specify which of the available service rates is to be employed at each stage. The cost structure includes an operating cost for running each stage and a service facility profit earned when a service completion occurs at Stage 2. We assume that the system has a finite waiting capacity in front of each station and each customer requires two services which must be done in sequence, that is, customers must pass through Stage 1 and Stage 2 in that order. Processing must be in the order of arrival at each station. The objective is to minimize the total discounted expected cost in a two-stage tandem queueing service system, which we formulate as a Discrete-Time Markov Decision Process. We present analytical and numerical results that specify the form of the optimal dynamic operating policy for a two-stage tandem queueing service system.

• Proceedings of the KSR Conference
• /
• 2009.05a
• /
• pp.1851-1858
• /
• 2009

As the ticket issuing methods have been diversified for the convenience of the passengers such as ticketless service(SMS ticket, e-ticket, home ticket), automatic ticket issuing machine and consignment ticket sale, maintaining the current number of ticket booth has been becoming a issue. This study is designed to simulation for the optimum number of ticket booth and which can affect an efficient operation of train station and improvement of customer convenience. This study is proceeding and will contribute to minimize customer waiting time at the ticket booth. In addition, presenting the optimum number of booth is expected to have an effect on the increase of productivity and cost savings.

• Journal of Korean Institute of Industrial Engineers
• /
• v.21 no.3
• /
• pp.345-356
• /
• 1995

The aim of this paper is to analyze the batch service queueing model M/M(a, b ; ${\mu}_k/1$) under general bulk service rule with mean service rate ${\mu}_k$ for a batch of k units, where $a{\leq}k{\leq}b$. This queueing model consists of the two-dimensional state space so that it is characterized by two-dimensional state Markov process. The steady-state solution and performane measure of this process are derived by using Matrix Geometric method. Meanwhile, a new approach is suggested to calculate the two-dimensional traffic density R which is used to obtain the steady-state solution. In addition, to determine the optimal service initiation threshold a, a decision model of this queueing system is developed evaluating cost of service per batch and cost of waiting per customer. In a job order production system, the decision-making procedure presented in this paper can be applicable to determining when production should be started.

• Journal of Korean Society for Quality Management
• /
• v.17 no.2
• /
• pp.142-148
• /
• 1989

In order to determine the level of service which minimizes the total of expected cost of service and the expected cost of waiting for that service, the important considerations are to evaluate the distance traveled to and from a service facility (D) and the expected number of mechanics in queueing system (L). The travel-time models are very useful when the servers must travel to the customer from the service facility. Thus, in this paper we studied on the determination of the optimal service level by the travel-time models. In order to decide the optimal service level, (D) has been introduced as a uniform distribution and (L) has been introduced as M/M/S model of queueing theory.

• Journal of Korean Society of Transportation
• /
• v.28 no.2
• /
• pp.77-85
• /
• 2010

As the ticket issuing methods have been diversified for the convenience of the passengers such as ticketless service(SMS ticket, e-ticket, home ticket), automatic ticket issuing machine and consignment ticket sale, maintaining the current number of ticket booth has been becoming a issue. This study is designed to simulation for the optimum number of ticket booth and which can affect an efficient operation of train station and improvement of customer convenience. This study will contribute to minimize customer waiting time at the ticket booth. In addition, presenting the optimum number of booth is expected to have an effect on the increase of productivity and cost savings.

• Journal of Distribution Science
• /
• v.19 no.11
• /
• pp.59-68
• /
• 2021

Purpose: The Covid-19 pandemic has had excessively severe impacts on all the nodes and edges of any supply chain due to changes in consumer behaviours and lockdown restrictions from governments among countries. This article aims to provide a simulating experiment on how a supply chain deals with supply disruption risks by flexibility in the inventory level of each sector as a buffer considering the overall cost to fulfil demand in the market. Research design, data and methodology: Agent-based simulation techniques are used to determine the cost-efficiency and customer waiting time related to varying inventory levels of each member in the supply chain when using inventory buffers. Findings: This study has shown that any sudden changes in the inventory level of each sector are likely to impact the rest of the supply chain. Among all sectors, the wholesaler will be impacted more severely than others. Also, the manufacturing sector is the most suitable node to adjust inventory depending on its manufacturing ability. Conclusion: The findings of the study provide insightful implications for decision-makers to adjust inventory levels and policymakers to maintain manufacturing activities in the context of the pandemic restrictions to deal with the excessive demand and potential supply disruption risks.

• Culinary science and hospitality research
• /
• v.12 no.1 s.28
• /
• pp.188-202
• /
• 2006

With large corporations entering into the foodservice market, competitions among those foodservice providers became intense, leading to differentiated quality services in terms of portioning out the meal, its portion and waiting time, not to mention food quality. The purpose of providing foodservice is to satisfy its customers, to secure optimum level of profits, and attain continuous quality improvement. To have such purpose attained, all other factors affecting the foodservice should be allowed to play a role. The intensity of the work performed by the employees should be maintained at a steady level and systematically controlled. 'Service First’ principles upholding that customer satisfaction comes from good service should be applied at all times; customer satisfaction comes from the satisfaction of the employees. Customer satisfaction through good service will contribute to an increase in revenue which we get by subtracting operating expenses from the total sales, as it will lead to concluding a long-term supply contract or renewing the existing contract. To keep the operating expenses to the minimum level, it is important to effectively perform the cost control. Since personnel expenses occupy a large portion of the operating expenses, it is imperative to effectively control the labor costs. For this reason, this study will present an effective program for disposition of men with a large organization being centered around, where the number of people served at the mess hall varies greatly depending on a day of the week and a mealtime of the day.

• Journal of Korean Society of Transportation
• /
• v.22 no.7 s.78
• /
• pp.107-117
• /
• 2004

The growing demand for customer-response, made-to-order manufacturing and satisfactory delivery are stimulating the importance of commercial fleet management problem. Moreover, the rapid transformation to the customer-oriented multi-frequency, relatively small fleet, such as home delivery and Perishable goods, requiring prompt delivery and advanced real-time operation of vehicle fleets. In this paper we consider the vehicle routing problem(VRP) to minimize delivery completion time which is equal to the time that last customer wait for the vehicle in fleet operation. The mathematical formulation is different from those for the classical VRP which is minimizing cost/distance/time by running vehicles in manager's point of view. The key aspect of this model is not considering the return time from the last customer to depot in every vehicle path. Thereby, the vehicle dispatcher can afford to dynamically respond to customer demand and vehicle availability. The customer's position concerned with minimizing waiting time that may be applied for the delivery of product required freshness or delivery time. Extensive experiments are carried out to compare the performance of minimizing delivery completion time by using the ILOG Solver which has the advantage of solving quickly an interim solution very near an optimal solution. The experimental results show that the suggested model can easily find near optimal solution in a reasonable computational time under the various combination of customers and vehicles.