• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.8 no.11
• /
• pp.79-83
• /
• 1985

This paper is to develop four heuristic algorithms for $n/m/D/F/F_{max}$. A study present numerical example for (H1) algorithm. Among the sequence generated, the best sequence is J2, J1, J6, J7, J4, J3, J5 and makespan is 528. The optimal makespan of this numerical example can be found as 528 as also, and the worst value of heuristic solution is only 7.2 % away from it.

• Journal of the Korea Safety Management & Science
• /
• v.3 no.4
• /
• pp.103-112
• /
• 2001

In Factory, as the number of machine is increased the more maintenance efforts are necessary. Multi maintenance issues may occur at a certain time and the determination of maintenance sequence is needed. In this study, we first compare the priority of machines and the impact value using modified FMEA(Failure Mode Effect and Analysis) method. Also, CBR(Case-based Reasoning) approach is applied to retrieve similar fault cases of current machine problem. The proposed methodology will be useful to implement decision support system of maintenance sequence for CMMS/EAM (Computerized Maintenance Management System/Enterprise Asset Management).

• Journal of Korean Society for Quality Management
• /
• v.17 no.2
• /
• pp.121-141
• /
• 1989

This paper is concerned with a development and evaluation of heuristics for the multi-stage sequence dependent flowshop sequencing. Eighteen heuristics, CAM1, CAM2, and etc., are proposed. The performance measure is a makespan which is to be minimized. The experiment for each algorithm is designed for a 4*3*3 factorial design with 360 observations. The experimental factors are PS(ratio of processing times to setup times), M(number of machines), N(number of jobs). The makespan of the proposed heuristics is compared with the optimal makespan obtained by the complete enumeration of schedules. This yardstick of comparison is called a relative error. The mean relative errors of the eighteen heuristics are from 2.048% to 8.717%. The computational results are analysed using SPSS. The experimental results show that the three factors are statistically significant at 5% level. The simulation for the large size problems is conducted to show having the similar computational results like the small size problems.

• Journal of Korean Institute of Industrial Engineers
• /
• v.12 no.1
• /
• pp.1-11
• /
• 1986

This research is concerned with n jobs, m parallel identical machines scheduling problem in which all jobs have a common due date. The objective of the research is to develop an optimum scheduling algorithm for determining an optimal job sequence, the optimal value of the common due date and the minimum makespan to minimize total cost. The total cost is based on the common due date cost, the earliness cost, the tardiness cost and the flow time cost of each job in the selected sequence. The optimum scheduling algorithm is developed. A numerical example is given to illustrate the scheduling algorithm.

• Journal of Korean Institute of Industrial Engineers
• /
• v.31 no.4
• /
• pp.316-333
• /
• 2005

Although some successful recognition algorithms have been developed, most of them did emphasize on extracting accurate interpretations without considerations of manufacturability. Evaluating the manufacturability for multiple features leads to produce the machining sequences. In this paper, the A* algorithm guarantees the optimal setup sequences with minimizing the machining cost. Also, tolerances including surface roughness are converted to STEP formats to be utilized for more reliable process plans. Finally, decision tables are used to create the detailed operational sequences based on geometric tolerances and surface roughness. Machining parameters such as feed, depth of cut, and cutting speed for each operation are added to the routing sheet. Windows are presented to show how the entire system works for a sample part.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.4 no.3
• /
• pp.252-256
• /
• 2003

This paper deals with a case study on the development of computerized scheduling system for core products. We propose a heuristic algorithm which is based on the sequencing rules and the allocation rules to satisfy the due date for each product, and develop a scheduling system for the manufacturer of core products. The system operates under a client/server circumstance. The important information constitutes a database, and it can be retrieved whenever it is needed. The benefits of the scheduling system are the exclusion of hand operations of data, the reduction of execution time for production planning and the reduction of average inventories.

• Proceedings of the KAIS Fall Conference
• /
• 2010.11b
• /
• pp.792-796
• /
• 2010

차세대 반도체 공정인 450mm 웨이퍼 생산 환경의 가장 큰 특징은 반도체 생산의 전 공정에 대한 완전 자동화이다. 이러한 완전 자동화는 작업자의 공정개입을 불가능하게 하고 개별 웨이퍼의 중요도를 크게 증가시키며 전체 반도체 생산 공정에 대한 견고한 디스패칭 시스템을 필요로 한다. 또한, 차세대 반도체 공정의 디스패칭 시스템은 개별 웨이퍼에 대한 실시간 모니터링과 데이터 수집이 가능해야 하며, 수집된 반도체 공정의 정보를 반영한 실시간 디스패칭이 가능해야 한다. 본 연구에서는 차세대 반도체 환경인 450mm 웨이퍼 생산 환경에서 중요한 역할을 하는 클러스터 툴에 대해 분석하고 클러스터 툴에서 웨이퍼의 작업순서를 결정할 수 있는 디스패칭 알고리즘을 제안한다.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2004.04a
• /
• pp.451-456
• /
• 2004

This study was performed to analyze the operation system of transfer crone to improve the reality of yard operation roles in container terminal and present the applicable method of operation rules to apply the operation priority. And we derived the procedure to estimate the maximum number of waiting truck based on the waiting of truck and the occupancy of driving lane in yard, and analyzed the constraint state of space. To solve the space constraint, we provided a multi-job principle to define the space resource and described the solution and sequence diagram for the principle.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2008.02a
• /
• pp.147-150
• /
• 2008

현재의 비디오 카메라는 인간의 눈으로 볼 수 있는 것과 동일한 화질의 비디오 영상을 얻을 수 없다. 인간의 눈은 움직이는 물체에 중점을 두고 초점을 맞추는 시각적 특성을 가진다. 하지만 현재의 비디오 카메라 시스템은 영상에 대한 인간의 눈의 시각적 특성에 대한 고려 없이 조리개와 렌즈의 조절 작업이 이루어진다. 본 논문은 이러한 비디오 카메라 시스템의 개선을 위해 인간의 눈의 시각적 특성에 기반을 둔 실시간 피사체 적응 비디오 카메라 시스템을 제안한다. 제안하는 알고리즘은 영상내에서 움직임을 가진 물체를 찾아낸 뒤, 이것에 가중치를 두고 조리개와 초점제어 작업의 순서로 이루어진다. 움직이는 물체는 영상 코덱의 움직임 정보를 파악하여 찾아내었다. 제안된 알고리즘은 프로그램언어로 구현되었으며, 초점거리와 조리개제어가 가능한 카메라와 PC를 사용하여 영상을 분석, 검증하였다.

• 한국지형공간정보학회:학술대회논문집
• /
• 2005.08a
• /
• pp.73-83
• /
• 2005

This study aims to establish the quality checking factors for the construction process of digital topographic map. Total 17 regulations related to quality of digital topographic map and major aerial survey firms are analyzed in terms of working process, equipments, and accuracy of results. It is standardized the process of making new digital maps using aerial photography, revising existing digital maps, and digitizing paper map. Quality checking factors for the construction process of digital topographic map are also established.