• Asia Marketing Journal
• /
• v.12 no.1
• /
• pp.1-30
• /
• 2010

Customers often experience waiting for buying service. Managing customers' waiting time is important for service providers since customers who are dissatisfied with waiting, secede from a service place at last. Not a few studies have been done to solve waiting time problem and improve customers' waiting experience. Hui & Tse(1996) identify evaluation factors in customers' behavioral mechanism as customers wait. That is, customers experience perceived waiting time, waiting acceptability and emotional response to the wait when they wait. Since customers evaluate the wait using these factors, service provider should manage these factors in order to minimize customers' dissatisfaction. Therefore, this study explores that evaluation factors of waiting are influenced by customers' situational and experiential characteristics, which include customer loyalty, transaction importance for customer and waiting expectation level. Those situational and experiential characteristics are usually given to service providers so they can't control these at waiting point. The major findings derived from two exploratory studies can be summarized as follows. First, according to the result from the study 1 (restaurant setting), customers' transaction importance has the greatest positive influence on waiting experience. The results show restaurant service provider could prevent customers' separation effectively through strategies which raise customers' transaction importance, like giving special coupons for important events. Second, in study 2 (amusement part setting) customer loyalty has large positive impact on waiting experience as well as transaction importance. This results show that service provider could minimize customers' dissatisfaction using strategies which raise customer loyalty continuously. This results show customer perceives waiting experience differently according to characteristics of service place and service itself. Therefore, service provider should grasp the unique customers' situational and experiential characters for each service and service place. It could provide an effective strategy for waiting time management. Third, the study finds transaction importance and waiting expectation level have direct influence customers' waiting experience as independent variables, while existing studies treated them as moderators. Customer loyalty which has not been incorporated in previous waiting time research is known to affect waiting experience. It suggests that marketing strategy which builds up customer loyalty for long period of time is also quite effective, compared to short term tactics to help customers endure waiting time. Fourth, this study reveals the importance of actual waiting time along with perceived waiting time. So far most studies only focus on customers' perceived waiting time. Especially, this study incorporates the concept of patient limit on waiting time to investigate effect of actual waiting time. The results show that there were various responses to the wait depending on how actual waiting time exceeds individual's patent limit on waiting time or not, even though customers wait about the same period of time. Finally, using structural equation model, conceptual path between behavioral responses is verified. As customer perceives waiting time, then she decides whether she can endure it or not, and then her emotional response occurs. This result are somewhat different from Hui & Tse(1996)'s study. The study also includes theoretical contributions as well as practical implications.

• Journal of Korean Institute of Industrial Engineers
• /
• v.35 no.4
• /
• pp.266-279
• /
• 2009

This paper focuses on the problem of scheduling wafer lots with limited waiting times between pairs of consecutive operations in a semiconductor wafer fabrication facility. For the problem of minimizing total tardiness of orders, we develop a priority rule based scheduling method in which a scheduling decision for an operation is made based on the states of workstations for the operation and its successor or predecessor operation. To evaluate performance of the suggested scheduling method, we perform simulation experiments using real factory data as well as randomly generated data sets. Results of the simulation experiments show that the suggested method performs better than a method suggested in other research and the one that has been used in practice.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.2
• /
• pp.97-104
• /
• 2013

This paper introduces waiting time based periodic packet discard policy for frame based scheduler. This policy can be used with conventional packet discard policy or buffer management schemes, such as drop-tail or random early detection. Proposed discard policy discards packets, which are stayed in the buffer longer than threshold, at every period of scheduling. This decision of discard is based on waiting time of packet. In this paper, mathematical analysis is performed with situation of network congestion. Also, the simulation is performed to evaluate the performance of proposed discard policy. In the result, proposed discard policy can limit queuing delay by threshold. Also, if the packet discard is performed before scheduling and threshold is set with smaller value than frame length, it can limit the throughput of traffic.

• Journal of the Korea Society for Simulation
• /
• v.17 no.2
• /
• pp.63-74
• /
• 2008

The design of best efficient production process is common requirements of the production strategy department and the process planning department to maximize the revenue and accomplish target production volumes in the production periods. And they use several general methods for that-line-balancing, removing of the bottle-neck process, facility ramp-up, increasing of the worker's utilization, etc. But, those methods have depended on analytic, static and arithmetic calculations, yet. So, irregular work-waiting time causing the delay time isn't include in extracting production capacity, especially in the line production process. The work-waiting time is changed irregularly along the variation of each machine and very important for calculate real product lead-time and forecasting target production volumes. At this thesis, i'm going to mention the importance of the delay time of conveyor system which can be extracted by discrete-event simulation. And suggest it as a new main variable that must be considered at designing new production system. Then experimented and tested that's effects in the H-company case, conveyor based line production process.

• Korean Management Science Review
• /
• v.29 no.2
• /
• pp.157-165
• /
• 2012

This paper researches on the effective and efficient logistics policy for the parcel express company. The paper derives new policy by considering the number of used vehicles, carbon emission amount, delivery completion time, etc. The maximum waiting of delivery is considered as the time limit T day. To verify the effectiveness of the derived policy, the data of 30 days is generated, and it was shown that the derived policy is very effective compared with the conventional one.

• Journal of the military operations research society of Korea
• /
• v.24 no.1
• /
• pp.98-109
• /
• 1998

This study develops a maintenance strategy for a reparable 2-unit standby system. The maintenance strategy implies the waiting time to call the repair facility when the unit-1 fails. Almeida and Souza set up the multi-attribute utility function consisting of system availability and repair cost for several maintenance strategies and decide the optimal maintenance strategy that maximize the expected value of the utility function. We decide the optimal maintenance strategy satisfying the following two criteria about the utility function : maximum variance using Almeida and Souza's utility function. It both criteria are not satisfied at the same time for every strategies, the strategy maximizing the lower confidence limit for expected utility function is regarded as an optimal one.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.11 no.1
• /
• pp.9-14
• /
• 2016

Since Devices such labtop, tablet, smartphone have been developed, a lots of huge data that can be classified as content is flooded in the network. According to changing Internet usage, Content-Centric Network(CCN) what is new concept of Internet Architecture is appeared. Initially, CCN is studied on wired network. but recently, CCN is also studied on wireless network. Since a characteristic of wireless environment is different from a characteristic of wired environment, There are issues in wireless CCN. In this paper, we discuss improvement method of Data spread issue on wireless CCN. The proposed scheme of this paper use MAC Address of nodes when Interest and Data Packet are forwarded. As using the proposed scheme, we reduce the spread of Data and offer priority of forwarding to nodes of shortest path, reduce delay by modifying retransmission waiting time.

• Proceedings of the Safety Management and Science Conference
• /
• 2000.11a
• /
• pp.95-99
• /
• 2000

The domestic ports become less competitive for the out of dated equipments and inefficient information system. Specially, Inchon Port, which is the second largest port of Korea, has the point at issue such as the excessive logistics cost because of the limit of handling capacity and the chronic demurrage. In this paper to develope the simulation programs the basic input parameters such as arrival intervals, cargo tons, service rates are analyzed and the probability density functions for there variable are estimated. Also to perform the conception of continuous berth utilization, the berth and cargo classification is reconstructed. And the more actual simulation is realized by using more detailed depth representation of water The simulation model is executed based on the knowledge base and database, and is constructed using Visual Basic and Access database. Simulation results reveal that this study suitably reflect the real berth operation and waiting time of ships is shortened.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.10 no.6
• /
• pp.74-83
• /
• 2011

The high-pass transportation information system directly collects section information by using probe cars and therefore can offer more reliable information to drivers. However, because the running condition and features of probe cars and statistical processing methods affect the reliability of the information and particularly because the section travel time is greatly influenced by whether there has been delay by signals on urban roads or not, there can be much deviation among the collected individual probe data. Accordingly, researches in multilateral directions are necessary in order to enhance the credibility of the section information. Yet, the precedent studies related to high-pass information provision have been conducted on the highway sections with the feature of continuous flow, which has a limit to be applied to the urban roads with the transportational feature of an interrupted flow. Therefore, this research aims at analyzing the features of high-pass transportation data on urban roads and finding a proper processing method. When the characteristics of the high-pass data on urban roads collected from RSE were analyzed by using a time-space diagram, the collected data was proved to have a certain pattern according to the arriving cars' waiting for signals with the period of the signaling cycle of the finish node. Moreover, the number of waiting for signals and the time of waiting caused the deviation in the collected data, and it was bigger in traffic jam. The analysis result showed that it was because the increased number of waiting for signals in traffic jam caused the deviation to be offset partially. The analysis result shows that it is appropriate to use the mean of this collected data of high-pass on urban roads as its representative value to reflect the transportational features by waiting for signals, and the standard of judgment of delay and congestion needs to be changed depending on the features of signals and roads. The results of this research are expected to be the foundation stone to improve the reliability of high-pass information on urban roads.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2B
• /
• pp.129-136
• /
• 2006

We propose a new data carousel scheduling algorithm for on-demand data broadcasting in DMB. The server divides data items into two sets named hot and cold, according to request statistics from clients. When constructing a data carousel, hot items are placed periodically with their upper limit of broadcasting frequency. If there are empty slots after placing hot items, cold items with high request ratio are placed until the carousel is full. A cold item is broadcast only once in the caroulsel. For the response on clients' requests, our proposed scheme is shown to have high success ratio with short waiting time.