• 제어로봇시스템학회논문지
• /
• 제18권2호
• /
• pp.156-160
• /
• 2012

In this paper, we investigate the effect of asynchronous haptic and video feedback on the performance of teleoperation. To analyze the effect, a tele-manipulation experiment is specially designed, which operator moves square objects from one place to another place by using master/slave telerobotic system. Task completion time and total number of falling of the object are used for evaluating the performance. Subjective study was conducted with 10 subjects in 16 different combinations of video and haptic feedback while participants didn't have any prior information about the amount of each delay. Initially we assume that synchronized haptic and video feedback would give best performance. However as a result, we found that the accuracy was increased when haptic and video feedback was synchronized, and the completion time was decreased when one of the feedback (either haptic or video) was decreased. Another interesting fact that we found in this experiment is that it showed even better accuracy when haptic information arrives little bit earlier than video information, than the case when those are synchronized.

• 한국경영과학회지
• /
• 제33권2호
• /
• pp.87-101
• /
• 2008

This paper considers an order scheduling model to minimize the total weighted tardiness of orders. Each order requires different types of products. Each type of product is manufactured on its dedicated machine specified in advance. The completion time of each order is represented by the time when all the products belonging to the order are completed. The objective of this paper is to find the optimal production schedule minimizing the total weighted tardiness of a finite number of orders. In the problem analysis, we first derive a powerful solution property to determine the sequence of two consecutive orders. Moreover, two lower bounds of objective are derived and tested along with the derived property within a branch-and-bound scheme. Two efficient heuristic algorithms are also developed. The overall performances of the proposed property, branch-and-bound and heuristic algorithms are evaluated through various numerical experiments.

• 한국건축시공학회:학술대회논문집
• /
• 한국건축시공학회 2019년도 춘계 학술논문 발표대회
• /
• pp.78-79
• /
• 2019

A construction project with a total construction cost of over 10 billion KRW should be evaluated whether construction works are appropriately executed. The evaluation is carried out on quality management, process management, construction management, safety management, environmental management. The implementation period is within 60 days after completion of construction of the construction, from the time when the construction rate of the construction work has progressed by more than 90% to the construction cost. However, the participating construction engineers should prepare the evaluation within the period according to the evaluation criteria, but there are difficulties in preparation for the evaluation due to the reasons such as the change of engineers in charge and loss of data. Therefore, this study proposes the procedure of construction evaluation and adjusts timing of construction evaluation.

• 산업경영시스템학회지
• /
• 제38권3호
• /
• pp.169-180
• /
• 2015

Recently, scheduling problems with position-dependent processing times have received considerable attention in the literature, where the processing times of jobs are dependent on the processing sequences. However, they did not consider cases in which each processed job has different learning or aging ratios. This means that the actual processing time for a job can be determined not only by the processing sequence, but also by the learning/aging ratio, which can reflect the degree of processing difficulties in subsequent jobs. Motivated by these remarks, in this paper, we consider a two-agent single-machine scheduling problem with linear job-dependent position-based learning effects, where two agents compete to use a common single machine and each job has a different learning ratio. Specifically, we take into account two different objective functions for two agents: one agent minimizes the total weighted completion time, and the other restricts the makespan to less than an upper bound. After formally defining the problem by developing a mixed integer non-linear programming formulation, we devise a branch-and-bound (B&B) algorithm to give optimal solutions by developing four dominance properties based on a pairwise interchange comparison and four properties regarding the feasibility of a considered sequence. We suggest a lower bound to speed up the search procedure in the B&B algorithm by fathoming any non-prominent nodes. As this problem is at least NP-hard, we suggest efficient genetic algorithms using different methods to generate the initial population and two crossover operations. Computational results show that the proposed algorithms are efficient to obtain near-optimal solutions.

• 혜화의학회지
• /
• 제5권2호
• /
• pp.473-484
• /
• 1997

This study was performed to survey the specific information about the time of onset, frequency, duration, and severity of the side effect of radiation therapy following breast cancer surgery, and identify the difference of these data according to the type of breast cancer surgery : modified radical mastectomy(MRM) vs. breast consevative operation(BCO). 38 breast cancer patients were interviewed with side effect profile about radiation therapy. Interview was done weekley from the start of radiation therapy through 6 weeks and 3 month follow-up interview was done at 3 month after completion of the treatment. The results are as follow : 1. Total score of side effect experienced by the breast cancer patients was rapidly increased at 2-3 week after intiating treatement and continousely raised maintaing high score until completion of the treatement. Some problems like cough, dyspnea and pain were more experienced after treatment. 2. Patients with modified radical mastectomy showed more total score of side effects than patients with breast conservative operation. And both patients with MRM and BCO experienced similar pattern of side effect to radiation therapy. Through these data we concluded that side effect to radiation therapy was not ended at completion of treatement. Patents will continously experiend various problems and suffer from not only acute side effects like skin problem, sore throat and swollowing difficulty but also late effect of the radiation therapy. Clinically these data can be used for oncologic nurse to provide informational interventions to prepare breast cancer patients for the radiation therapy.

• Journal of Gastric Cancer
• /
• 제22권3호
• /
• pp.210-219
• /
• 2022

Purpose: Completion total gastrectomy (CTG) for remnant gastric cancer (RGC) is a technically demanding procedure and associated with increased morbidity. The present study aimed to evaluate postoperative complications and their risk factors following surgery for RGC after initial partial gastrectomy due to gastric cancer excluding peptic ulcer. Materials and Methods: We retrospectively reviewed the data of 107 patients who had previously undergone an initial gastric cancer surgery and subsequently underwent CTG for RGC between March 2002 and December 2020. The postoperative complications were graded using the Clavien-Dindo classification. Logistic regression analyses were used to determine the risk factors for complications. Results: Postoperative complications occurred in 34.6% (37/107) of the patients. Intra-abdominal abscess was the most common complication. The significant risk factors for overall complications were multi-visceral resections, longer operation time, and high estimated blood loss in the univariate analysis. The independent risk factors were multi-visceral resection (odds ratio [OR], 2.832; 95% confidence interval [CI], 1.094-7.333; P=0.032) and longer operation time (OR, 1.005; 95% CI, 1.001-1.011; P=0.036) in the multivariate analysis. Previous reconstruction type, minimally invasive approach, and current stage were not associated with the overall complications. Conclusions: Multi-visceral resection and long operation time were significant risk factors for the occurrence of complications following CTG rather than the RGC stage or surgical approach. When multi-visceral resection is required, a more meticulous surgical procedure is warranted to improve the postoperative complications during CTG for RGC after an initial gastric cancer surgery.

• 한국시뮬레이션학회논문지
• /
• 제24권4호
• /
• pp.77-88
• /
• 2015

본 논문은 작업별 위치기반 지수학습 효과를 갖는 2-에이전트 단일기계 스케줄링 문제를 고려한다. 에이전트 A는 가중 완료 시간의 합을 최소화하며, 에이전트 B는 총소요시간에 대한 상한 값을 만족하는 조건을 갖는다. 본 연구에서는 먼저 우수해/가능해에 대한 특성을 개발하고, 이를 이용하여 최적 해를 찾기 위한 분지한계 알고리즘을 설계한다. 또한 근사 최적 해를 구하기 위해 6가지 다른 초기해 생성 방법을 이용한 시뮬레이티드 어닐링 알고리즘을 제안한다. 수치 실험을 통해 제안된 알고리즘의 우수한 성능을 검증한다. 실험 결과, 다른 초기해 생성 방법들 간에는 %errors 차이가 유의하게 발생하지 않았으며, 에이전트 A의 작업 순서를 무작위로 생성할 때 성능이 좋아짐을 발견하였다. 반면에, 에이전트 B의 초기해 생성 방법은 성능에 영향을 미치지 않았다.

• 한국경영과학회지
• /
• 제38권2호
• /
• pp.25-42
• /
• 2013

We consider a project time-cost tradeoff problem with two milestones, where one of the jobs has an uncertain processing time. Unless each milestone is completed on time, some penalty cost may be imposed. However, the penalty costs can be avoided by compressing the processing times of some jobs, which requires additional resources or costs. The objective is to minimize the expected total costs subject to the constraint on the expected project completion time. We show that the problem can be solved in polynomial time if the precedence graph of a project is a chain.

• 산업경영시스템학회지
• /
• 제29권2호
• /
• pp.7-12
• /
• 2006

This study considers the problem of scheduling jobs on uniform parallel machines with a common due date. The objective is to minimize the total absolute deviation of job completion times about the common due date. This problem is motivated by the fact that a certain phase of printed circuit board manufacturing is bottleneck and the processing speeds of parallel machines in this phase are uniformly different for all jobs. Optimal properties are proved and a simple polynomial time optimal algorithm is developed.

• 산업경영시스템학회지
• /
• 제37권4호
• /
• pp.187-192
• /
• 2014

Lot-streaming is the process of splitting a job (lot) into sublots to allow the overlapping of operations between successive machines in a multi-stage production system. A new genetic algorithm (NGA) is proposed for an n-job, m-machine, lot-streaming flow shop scheduling problem with equal-size sublots in which the objective is to minimize the total stretch. The stretch of a job is the ratio of the amount of time the job spent before its completion to its processing time. NGA replaces the selection and mating operators of genetic algorithms (GAs) by marriage and pregnancy operators and incorporates the idea of inter-chromosomal dominance and individuals' similarities. Extensive computational experiments for medium to large-scale lot-streaming flow-shop scheduling problems have been conducted to compare the performance of NGA with that of GA.