• 한국경영과학회지
• /
• 제20권1호
• /
• pp.179-193
• /
• 1995

A multi-objective, single-stage scheduling problem with stochastic processing times is considered where the objective is to simultaneously minimize the expected value and the variance of total flowtime, and the mean probability of tardiness. In cases where processing times follow normal distributions, a method using pairwise interchange of two jobs(PITJ) is proposed to generate a set of the approximate efficient schedules. The efficient schedules are not dominated by the criterion vectors of any other permutation schdules in the feasible region. Numerical experiments performed to ascertain the effectiveness of PITJ algorithm are also reported in the results.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1995년도 춘계공동학술대회논문집; 전남대학교; 28-29 Apr. 1995
• /
• pp.939-954
• /
• 1995

We propose a policy for controlling the release of raw wafers into the semiconductor wafer fabrication lines. The proposed policy exploits up-to-date factory floor information gathered by tracking systems used to calculate the time and amount of a new release to minimize mean flow times and mean tardiness while maintaining the maximum output rates of the system. Extensive computer experiments show that the proposed policy results in significant improvements for the same output rates compared to existing release rules.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1996년도 추계학술대회발표논문집; 고려대학교, 서울; 26 Oct. 1996
• /
• pp.299-302
• /
• 1996

The purpose of this study is developing scheduling logic and program for machining scheduling of automobile part production line with unbalanced processing time. Three rules are developed to minimize slack and effect on other job. Fourth rule is suggested which considered weighted sum of three factors. schedule is generated totally 1, 000 times and then optimal weight parameter is selected. The program is developed to schedule situation to compare with the performance measure, total finish time of machine and total tardiness of part. As a result, the rule which considered weighted sum of three factors is effective for both measure.

• 대한안전경영과학회:학술대회논문집
• /
• 대한안전경영과학회 2003년도 춘계학술대회
• /
• pp.285-290
• /
• 2003

There is only one server available and arriving work require services from this server. Job are processed by the machine one at a time. The most common objective is to sequence jobs on the severs so as to minimize the penalty for being late, commonly called tardiness penalty Based on other objectives, many criteria may serve as s basis for developing job schedules. Therefore, this study tries to proposed that Scheduling by customer needs group for minimizing the problem and reducing inventory, product development time, cycle time, and order lead time.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1997년도 한국자동제어학술회의논문집; 한국전력공사 서울연수원; 17-18 Oct. 1997
• /
• pp.844-847
• /
• 1997

In this paper, scheduling problem is dealt for the minimization of due date penalty for the customer order. Multiproduct batch processes have been dealt with for their suitability for high value added low volume products. Their scheduling problems take minimization of process operation for objective function, which is not enough to meet the customer satisfaction and the process efficiency simultaneously because of increasing requirement of fast adaptation for rapid changing market condition. So new target function has been suggested by other researches to meet two goals. Penalty function minimization is one of them. To present more precisely production scheduling, we develop new scheduling model with penalty function of earliness and tardiness We can find many real cases that penalty parameters are divergent by the difference between the completion time of operation and due date. That is to say, the penalty parameter values for the product change by the customer demand condition. If the order charges different value for due date, we can solve it with the due date period. The period means the time scope where penalty parameter value is 0. If we make use of the due date period, the optimal sequence of our model is not always same with that of fixed due date point. And if every product have due date period, due date of them are overlapped which needs optimization for the maximum profit and minimum penalty. Due date period extension can be enlarged to makespan minimization if every product has the same abundant due date period and same penalty parameter. We solve this new scheduling model by simulated annealing method. We also develop the program, which can calculate the optimal sequence and display the Gantt chart showing the unit progress and time allocation only with processing data.

• 대한한의학회지
• /
• 제38권4호
• /
• pp.90-103
• /
• 2017

Objectives: This study was designed to confirm the effects of the Korean Medicine health promotion program targeting young children. One important aspect of the Korean Medicine health promotion program for children is to bring awareness of health benefits of introducing Korean Medicine methods to young children and to promote incorporating such methods in children's daily activities to develop healthy habits. Methods: The following experiment was conducted for 6 weeks, and the participants were in the age between 2 to 6 years old from 6 child care centers in Wonju and Chungju. 268 participants were in the intervention group, and 277 in the control group. To measure the outcomes of the Children Korean Medicine health program, the intervention group received Korean Medicine prevention programs (children education, parent education, growth exercises, common cold prevention scarf, and pear herb tea), control group did not. This research collected and compared the following data as the children's health indicators to measure the outcomes before and after the program: medical services usage, the number of absences, early leaves, and tardiness to the child care centers due to the participant's health condition. Results: After applying the children's health promotion programs on children between the age of 2-6, there was a decrease in the overall medical services usage, absences, early leaves, and tardiness to the child care center. This health promotion program was purely based on Korean medical theories and Korean Medicine resources without any conventional medical mediation. Conclusions: It can be concluded that a positive change was noted in raising awareness of Korean Medicine through educating both the parents and children. By learning to incorporate Korean Medicine prevention practices to daily habits, not only was there a reduction in the Medical services usage, but the children also became familiar and comfortable with Korean Medicine and its treatment procedures; the overall satisfaction level of the program was also high.

• 한국산학기술학회논문지
• /
• 제13권4호
• /
• pp.1648-1653
• /
• 2012

일반적으로 후반부 공정에서의 불량은 전 제조공정에서 누적되어 온 부가가치의 손실로써 거의 완성품 가격에 해당하는 품질비용을 유발하게 되고 제조공정의 효율성에 악영향을 미치게 된다. 본 연구에서는 품질 변동성이 존재하는 후반부 제조공정을 대상으로 고객이 요구한 납기와 품질수준을 동시에 반영하는 작업투입 알고리즘을 제안한다. 본 연구에서 제안한 알고리즘의 성능을 평가하기 위하여 평균납기지연을 최소화하는 것을 목적으로 기존에 널리 사용되고 있는 대안들과의 성능 비교를 실시하여 그 우수성을 확인한다. 또한 고객이 요구한 품질요구수준에 따른 공정능력 관점에서도 본 연구에서 제시한 알고리즘이 뛰어난 성능을 보이는 것을 입증하였다.

• 한국멀티미디어학회논문지
• /
• 제7권7호
• /
• pp.886-895
• /
• 2004

본 논문에서는 멀티미디어 태스크와 경성 실시간 태스크가 공존하는 시스템에서 두 태스크들을 효율적으로 통합하고 스케쥴링하기 위한 CPU 대역폭의 동적 할당 기법이 제시된다. 연성 실시간적인 멀티미디어 태스크는 평균 실행 시간을 기반으로 처리되는 반면 경성 실시간 태스크는 최악의 경우에 대한 실행 시간을 기반으로 실행이 보장된다. 서버를 기반으로 하는 본 논문의 할당 기법은 CPU 대역폭을 두 태스크들에 대하여 분할한 후 특히 MPEG 비디오 스트림을 위한 멀티미디어 태스크들에 대하여는 할당된 대역폭을 다시 동적으로 조정한다. 제시된 기법의 목적은 시스템에 존재하는 경성 실시간 태스크들의 시간적 제약성을 모두 보장하면서 멀티미디어 태스크들의 종료시한이후 실행이 지연되는 시간을 최소화하는 것이다. 본 논문에서는 시뮬레이션 실험을 통하여 제시된 기법에서 멀티미디어 태스크들의 지연 시간이 다른 기법에 비하여 작아지는 결과를 보여주고 있다.

• 산업경영시스템학회지
• /
• 제38권4호
• /
• pp.159-167
• /
• 2015

We consider a wafer lot transfer/release planning problem from semiconductor wafer fabrication facilities to probing facilities with the objective of minimizing the deviation of workload and total tardiness of customers' orders. Due to the complexity of the considered problem, we propose a two-level hierarchical production planning method for the lot transfer problem between two parallel facilities to obtain an executable production plan and schedule. In the higher level, the solution for the reduced mathematical model with Lagrangian relaxation method can be regarded as a coarse good lot transfer/release plan with daily time bucket, and discrete-event simulation is performed to obtain detailed lot processing schedules at the machines with a priority-rule-based scheduling method and the lot transfer/release plan is evaluated in the lower level. To evaluate the performance of the suggested planning method, we provide computational tests on the problems obtained from a set of real data and additional test scenarios in which the several levels of variations are added in the customers' demands. Results of computational tests showed that the proposed lot transfer/planning architecture generates executable plans within acceptable computational time in the real factories and the total tardiness of orders can be reduced more effectively by using more sophisticated lot transfer methods, such as considering the due date and ready times of lots associated the same order with the mathematical formulation. The proposed method may be implemented for the problem of job assignment in back-end process such as the assignment of chips to be tested from assembly facilities to final test facilities. Also, the proposed method can be improved by considering the sequence dependent setup in the probing facilities.

• 한국빅데이터학회지
• /
• 제7권1호
• /
• pp.75-87
• /
• 2022

재작업은 제품의 품질 만족을 위해 요구되는 활동으로 제조 현장에서 필수적인 공정이다. 사전에 수행 여부의 파악이 어려운 재작업은 공정시간의 증가 및 제품의 납기 지연으로 이어질 수 있어 이를 고려한 스케줄링이 중요하다. 본 연구에서는 자동차 배관 생산라인인 재작업이 존재하는 유연흐름라인을 대상으로 Dispatching을 통한 평균 흐름시간과 납기지연의 가중합을 최소화하는 스케줄링 연구를 진행하였다. 본 연구에서는 제품별 납기 등 고객 요구와 재작업 및 가공시간 등의 변동성이 존재하는 제조환경에서 Dispatching을 위한 가중치 기반 Dispatching 규칙(WDR)을 제안한다. WDR은 여러 단일 Dispatching 규칙의 가중합으로 구성되며 본 연구는 가중치 탐색을 위해 시뮬레이션 기반 유전알고리즘을 적용하였다. 시뮬레이션 실험을 통해 WDR이 단일 Dispatching 규칙에 비해 우수한 성능을 보임을 확인하였다.