• Journal of the Korean Operations Research and Management Science Society
• /
• v.33 no.2
• /
• pp.115-135
• /
• 2008

An interesting problem in capacitated supply chains is how to guarantee customer service levels with limited resources. One of the common approaches to solve the problem is differentiating service depending on customer classes. High-priority customers receive a better service at the cost of low-priority customers' service level. One of common criteria to determine a customer's priority in practice is whether he has made a reservation before arrival or not. Customers with a reservation usually receive service based on the time the reservation was made. We examine the effect this advance information of customer arrival has on customer service levels. We show the trade-offs between the leadtime and other system characteristics such as the proportion of high-priority customers. when the service level is high. We also suggest how to differentiate service using the asymptotic ratio of the service levels for both types of customers.

• Journal of Korea Society of Industrial Information Systems
• /
• v.23 no.1
• /
• pp.53-63
• /
• 2018

In this paper, we analyze the waiting time of a queueing system with D-BMAP (discrete-time batch Markovian arrival process) and D-policy. Customer group or packets arrives at the system according to discrete-time Markovian arrival process, and an idle single server becomes busy when the total service time of waiting customer group exceeds the predetermined workload threshold D. Once the server starts busy period, the server provides service until there is no customer in the system. The steady-state waiting time distribution is derived in the form of a generating function. Mean waiting time is derived as a performance measure. Simulation is also performed for the purpose of verification and validation. Two simple numerical examples are shown.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.9 no.4
• /
• pp.127-134
• /
• 2013

While there are many services that can check current traffic condition and application program such as bus arrival alarm are developed, since it only provide simple alarm and check level of information, it is still insufficient in many senses. Therefore, the program that try to develop in this study is the system that predict arrival time to destination and inform the bus passengers by applying real time traffic information. The system developed related to this study is still very inadequate. In the system developed in this thesis, when the user input the current bus number and destination using smart-phone, relevant server acquire the bus route information from bus information DB, and analyze real time traffic information based on the information from traffic information DB, and inform customer of expected arrival time to destination. In this thesis, traffic congestion can be eased off and regular operation of public transportation can be improved with reliable destination arrival alarm. Also, it is considered that pattern of bus users can be analyzed by using these information, and analyzing average transport speed and time of public transportation, travel time depending on various situation can give a boost to study related to transportation information and its development.

• IE interfaces
• /
• v.25 no.3
• /
• pp.283-289
• /
• 2012

M/G/1 queue with server vacations period depending on the previous vacation and customer's arrival is considered. Most existing studies on M/G/1 queue with server vacations assume that server vacations are independent of customers' arrival. However, some vacations are terminated by some class of customers' arrival in certain queueing systems. In this paper, therefore, we investigate M/G/1 queue with server vacations where each vacation period has different distribution and vacation length is influenced by customers' arrival. Laplace-Stieltjes transform of the waiting time distribution and the distribution of number of customers waiting for each class of customers are respectively derived. As performance measures, mean waiting time and average number of customers waiting for each class of customers are also derived.

• 한국데이터정보과학회:학술대회논문집
• /
• 2006.04a
• /
• pp.43-47
• /
• 2006

Consider a multitype queue where queued customers arc served in their order of arrival at a rate which depends on the customer type. Here we calculate the sharp asymptotics of the probability the total number of customers in the queue reaches a high level before emptying. The natural state space to describe this queue is a tree whose branches increase in length as the number of customers in the queue grows. Consequently it is difficult to prove a large deviation principle. Moreover, since service rates depend on the customer type the stationary distribution is not of product form so there is no simple expression for the stationary distribution. Instead, we use a change of measure technique which increases the arrival rate of customers and decreases the departure rate thus making large deviations common.

• Journal of Korea Society of Industrial Information Systems
• /
• v.21 no.6
• /
• pp.1-12
• /
• 2016

In this paper, we consider a general discrete-time queueing system with D-BMAP(discrete-time batch Markovian arrival process) and D-policy. An idle single server becomes busy when the total service times of waiting customer group exceeds the predetermined workload threshold D. Once the server starts busy period, the server provides service until there is no customer in the system. The steady-state workload distribution is derived in the form of generating function. Mean workload is derived as a performance measure. Simulation is also performed for the purpose of verification and a simple numerical example is shown.

• Knowledge Management Research
• /
• v.19 no.4
• /
• pp.59-76
• /
• 2018

With the arrival of the big data era, customer data and data mining analysis have gradually dominated the process of Customer Relationship Management (CRM). This phenomenon indicates that customer data along with the use of information techniques (IT) have become the basis for building a successful CRM strategy. However, some companies can not discover valuable information through a large amount of customer data, which leads to the failure of making appropriate business strategy. Without suitable strategies, the companies may lose the competitive advantage or probably go bankrupt. The purpose of this study is to propose CRM strategies by segmenting customers into VIPs and Non-VIPs and identifying purchase patterns using the the VIPs' transaction data and data mining techniques (K-means clustering and association rules) of online shopping mall in Korea. The results of this paper indicate that 227 customers were segmented into VIPs among 1866 customers. And according to 51,080 transactions data of VIPs, home product and women wear are frequently associated with food, which means that the purchase of home product or women wears mainly affect the purchase of food. Therefore, marketing managers of shopping mall should consider these shopping patterns when they build CRM strategy.

• Management Science and Financial Engineering
• /
• v.2 no.1
• /
• pp.123-145
• /
• 1996

We consider a priority-based multiclass queue with probabilistic feed-back. There are J service stations. Each customer belongs to one of the several priority classes, and the customers of each class arrive at each station in a Poisson process. A single server serves queued customers on a priority basis with a nonpreemptive scheduling discipline. The customers who complete their services feed back to the system instantaneously and join one of the queues of the stations or depart from the system according to a given probability. In this paper, we propose a new method to simplify the analysis of these queueing systems. By the analysis of busy periods and regenerative processes, we clarify the underlying system structure, and systematically obtain the mean for the sojourn time, i.e., the time from the arrival to the departure from the system, of a customer at every station. The mean for the number of customers queued in each station at an arbitrary time is also obtained simultaneously.

• Journal of Information Technology Services
• /
• v.3 no.2
• /
• pp.9-23
• /
• 2004

Interest about Information infrastructure construction is enlarged socially according to arrival of information age, and various information systems are constructed for efficient business processing, customer service in public sector. According to subjective method for performance improvement for information system of public sector and engine that propel information system construction because it is no definite hardware sizing guidelines for information system caterer, is calculating resource volume of information system. It is situation that problem of excess of scale or reduce sizing is happening and is causing various kind of problems that is waste of information budget and service decline thereby. In this research, we proposed hardware sizing framework for information system that is applied to pubic sector.

• 한국디지털정책학회:학술대회논문집
• /
• 2004.05a
• /
• pp.355-367
• /
• 2004

Interest about information infrastructure construction is decayed socially according to arrival of information age, and various information systems is constructed for efficient business processing, customer service improvement in public sector. According to subjective method of performance improvement for information system of public sector and engine that propel information system construction bemuse it is no definite hardware sizing guidelines for introduction or system caterer, is calculating resources scale of information system. Is situation that problem of excess of scale or reduction sizing is happening, and is causing various kinds problem that is waste of information budget and service decline thereby. So, We proposed hardware sizing framework for information system that is applied to information programs.