• 한국병원경영학회지
• /
• 제23권3호
• /
• pp.87-103
• /
• 2018

Purpose: This study investigates the best appointment pattern which can enhance customer's satisfaction and hospital's efficient management reflecting plastic surgery clinic's service characteristics. Methodology: The data of this study is obtained from Plastic surgery Clinic which is located in the civic center. By collecting and analyzing the data, we build the simulation model using ARENA. Based on 5 appointment patterns that was suggested in formal appointment scheduling studies, we experiment 3 simulation models; 'Basic Appointment Pattern' that has no restriction, 'Restriction on Second Customer' that restricts the number of second customer's in each slot, 'Restriction on Process Time' that restricts the number of second customer who has long process time in each slot. We can check robustness of the appointment patterns by experimenting on off-peak day and peak day, during peak season. Findings: This study confirms that these 2 restrictions can give a better result than 'Basic Appointment Pattern' that just simply distributes customers by number. Especially, the performance of Triangle-like pattern which is the best appointment pattern in the formal study has been improved by adding restrictions. Based on 'DET', 'Restriction on Second Customer' shows a better result. Meanwhile, based on 'E(WT)', 'Restriction on Process Time' shows a better result. Overall, based on 'DET+E(WT)', 'Restriction on Second Customer' shows a better result. Practical Implications: The purpose of each hospital may alter as demand for plastic surgery grows increasingly. Thus, each hospital should be always prepared to introduce appointment pattern for changed purpose. In order to respond flexibly to these changes, it is necessary for medical personnel to improve the awareness or for hospital to create an environment by constructing appointment program so that medical personnel does not need to put more labor on work.

• Management Science and Financial Engineering
• /
• 제9권2호
• /
• pp.47-68
• /
• 2003

We consider the customer order scheduling problem with job capacity restriction where the number of jobs in the shop at the same time is fixed. In the customer order scheduling problem, each job is part of some batch (customer order) and the composition of the jobs (product) in the batch is pre-specified. The objective function is associated with the completion time of the batches instead of the completion time of the jobs. We first summarize the known results for the general customer order scheduling problems. Then, we establish some new properties for the problems with job capacity restriction. For the case of unit processing time with the objective of minimizing makespan, we develop a polynomial-time optimal procedure for the two machine case. For the same problem with a variation of no batch alternation, we also develop a polynomial-time optimal procedure. Then, we show that the problems with the objectives of minimizing makespan and minimizing average batch completion time become NP-hard when there exist arbitrary number of machines. Finally, We propose optimal solution procedures for some special cases.

• 대한산업공학회지
• /
• 제35권2호
• /
• pp.150-159
• /
• 2009

The heterogeneous fleet vehicle routing problem(HVRP) is a variant of the classical vehicle routing problem in which customers are served by a heterogeneous fleet of vehicles with various capacities, fixed costs and variable costs. We propose a new conceptual HVRPCR(HVRP with customer restriction) model including additional customer restrictions in HVRP. In this paper, we develop hybrid particle swarm optimization(HPSO) algorithm with 2-opt and node exchange technique for HVRP. The solution representation is a n-dimensional particle for HVRP with N customers. The decoding method for this representation starts with the transformation of particle into a priority list of customer to enter route and limit of vehicle to serve each customer. The vehicle routes are then constructed based on the customer priority list and limit of vehicle to serve. The proposed algorithm is tested using 8 benchmark problems and it consistently produces high-quality solutions, including new best solutions. The numerical results show that the proposed algorithm is robust and efficient.

• 한국정보시스템학회지:정보시스템연구
• /
• 제22권4호
• /
• pp.49-69
• /
• 2013

Recently, enterprises have reinforced security control in order to prevent infringement of personal information and abuse of customer information by insiders. However, the reinforcement of security control by enterprises makes it difficult for internal users to perform business by using a business information system. There is, therefore, a need for research on various fields, which makes it possible to establish an appropriate security control policy while minimizing an impact on business. The present research verifies and analyzes an impact on difficulty in business of internal users using customer information, which is caused by security control performed by display restriction on customer information identifiers. The present research is intended to academically develop a technique for statistically analyzing an impact degree and a causal relationship between security control and an impact on business, which is a dichotomous variable, and to practically contribute to the establishment of an efficient security policy in consideration of an impact on business when an enterprise applies security control. A research target was internal business information systems of domestic securities enterprises, data was collected by questionnaire, and verification/analysis was performed by logistic regression analysis.

• 대한산업공학회지
• /
• 제31권3호
• /
• pp.228-239
• /
• 2005

In this paper, we propose a new conceptual HVRPCR(Heterogeneous Fleet Vehicle Routing Problem with Customer Restriction) model including additional restrictions that are consisted of loadage limit and possible visit number of demand post in HVRP. We propose HVRPCR algorithm using the heuristic in order to solve speedily because VRP is NP-Hard and need many solution time. The proposed model is simulated with changing demand post location, demand weight, loading and possible visit number limitation. Results of the computational experiment are provided along with some analysis like travel cost reduction rate.

• 한국산업경영시스템학회:학술대회논문집
• /
• 한국산업경영시스템학회 2002년도 춘계학술대회
• /
• pp.133-138
• /
• 2002

In this paper, we model a two-server queueing system with priority, to which we put a restriction of the number of servers for each customer class. A group of customers is divided into two different classes. The class 1 customers has non -preemptive priority over class 2 customers. We use the method of PGF depending on the state of server We find the PGF of the number of customers in queue, server utilization, mean queue length and mean waiting time for each class of customers.

• 대한산업공학회지
• /
• 제28권2호
• /
• pp.187-192
• /
• 2002

In this paper we consider an M/G/1 queueing system with vacation. The length of vacation period may be controlled by the waiting time of the first customer. The server goes on vacation as soon as the system is empty, and resumes service either when the waiting time of the leading customer reaches a predetermined value, or when the vacation period is expired, whichever comes first. We consider two types of vacation, say, multiple vacation type and N-policy type. We derive the steady-state distributions of the number of customers at arbitrary time and arbitrary customer's waiting time by means of decomposition property. Also, the mean lengths of busy period, idle period and a cycle time are given.

• 산업경영시스템학회지
• /
• 제25권5호
• /
• pp.31-38
• /
• 2002

In this paper, we model a two-server queueing system with priority, to which we put a restriction on the number of servers for each customer class. customers are divided into two different classes. Class 1 customers have non-preemptive priority over class 2 customers. They are served by both servers when available but class 2 customers are served only by a designated server. We use a method of generating function depending on the state of servers. We find the generating function of the number of customers in queue, server utilization, mean queue length and mean waiting time for each class of customers.

• 융합정보논문지
• /
• 제8권1호
• /
• pp.291-300
• /
• 2018

본 연구는 중소 언론사에 근무하고 있는 종사자들을 대상으로 하여 조직공정성과 임파워먼트가 고객지향성에 미치는 영향을 실증적으로 분석하였다. 고객지향성에 미치는 영향요인으로 조직공정성의 하위변수는 분배공정성, 절차공정성, 상호공정성으로 설정하였고, 임파워먼트의 하위 변수는 의미성, 역량, 자기결정력, 영향력으로 설정하였다. 분석 결과, 조직공정성의 분배공정성, 절차공정성, 상호공정성은 고객지향성에 영향을 미치는 요인으로 분석되었고, 임파워먼트의 역량, 자기결정력, 영향력 요인은 고객지향성에 영향을 미치는 요인으로 분석되었다. 그러나 임파워먼트의 의미성 요인은 고객지향성에 영향을 미치지 않는 요인으로 나타났다. 중소 언론사들의 근무환경은 인터넷 환경에서 시간과 공간에 대한 제약 없이 업무를 수행하고 있다. 이러한 환경은 종전에는 경험해 보지 못했던 디지털 환경이다. 그러나 조직의 공정성이나 임파워먼트 요인들은 선행 연구결과와 같은 관점에서 종전과 같이 고객지향성에 중요한 영향으로 분석되었다.

• 대한산업공학회지
• /
• 제17권1호
• /
• pp.59-73
• /
• 1991

In this paper, how to evaluate the assembly system was studied. The traction machine(TRM/C) is a kind of medium sized small quantity product. This work was performed on restriction of satisfying the customer's demand by simulating on the criteria of the queuing quantity in production system, the effectiveness of assembly machine and the average time spent on assembling. The problems about assembling were grasped through the analysis of products and process. The outputs of simulations that used SIMAN on four alternatives were evaluated on the basis of the average queuing quantity, the line effectiveness, the assembly time of a product and the production capacity.