• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1995.04a
• /
• pp.122-129
• /
• 1995

This paper presents a similarity coefficient based approach to the problem of machine-part grouping for cellular manufacturing. The method uses relevant production data such as part type, production volume, routing sequence to make machine cells and part families for cell formation. A new similarity coefficient using weighted factors is introduced and an algorithm for formation of machine cells and part families is developed. A comparative study of two similarity coefficients - Gupta and seifoddini's method and proposed method - is conducted. A software program using TURBO C has been developed to verify the implementation.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.559-563
• /
• 1996

선박 건조는 선체를 수십에서 많게는 이백여개에 블럭으로 분활하여 각 블럭에 해당하는 원자재를 처리 가공한 후 소조립, 중조립, 그리고 대조립의 과정을 거쳐 블럭으로 완성하여 이들 블럭을 정해진 순서에 맞추어 탑재하는 과정을 거치면서 기타 공정을 완료하여 마지막으로 진수에 이르게 된다. 본 연구에서는 선박 건조 과정에서 탑재 공정 계획을 위한 블럭의 접속 관계를 체계적으로 확립하여 탑재 순서를 생성하는 방법론을 제시하고 이러한 방법론을 바탕으로 초기 탑재 네트워크을 생성 방안을 제시한다.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.1030-1033
• /
• 2006

In this paper, the assignment problem is considered. We propose an approach based on the solution of a sequence of shortest path sub-problem. We extend the cost reduction method, which is used for finding initial assignment, to solve these sub-problems. The use of the extended reduction method makes it possible to devise an efficient multi-augmenting algorithm.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.405-408
• /
• 2000

The objective of this paper is to develop a model to integrate process planning and resource planning through analysis of the machine tool selection and operations sequencing problem. The model is formulated as a travelling salesman problem with precedence relations. To solve our model, we also propose an efficient genetic algorithm based on topological sort concept.

• Journal of Korean Society for Quality Management
• /
• v.22 no.2
• /
• pp.166-176
• /
• 1994

Some rank score tests are proposed for testing the equality of all sampling distribution functions against ordered location-scale alternatives in k-sample problem. Under the null hypothesis and a contiguous sequence of ordered location-scale alternatives, the asymptotic properties of the proposed test statistics are investigated. Also, the asymptotic local powers are compared with each others. The results show that the proposed tests based on the Hettmansperger-Norton type statistic are more powerful than others for the general ordered location-scale alternatives. However, the Shiraishi's tests based on the sum of two Bartholomew's rank analogue statistics are robust.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.18 no.2
• /
• pp.131-145
• /
• 1993

This paper deals with scheduling problem of the chemical process system where aircraft parts go through a given sequence of tanks filled with chemical solutions. The system has two hoists which move carriers holding the parts between tanks. A mixed integer programming model is developed from which a maximum throughput schedule can be found for the hoist movements. To show the validity of the model, a real world problem is solved and the results are compared with those with an existing approach.

• Proceedings of the Safety Management and Science Conference
• /
• 2003.05a
• /
• 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.

• Journal of Korean Society for Quality Management
• /
• v.22 no.3
• /
• pp.179-190
• /
• 1994

Financial variables have been used in bankruptcy prediction. Despite of possible errors in prediction, most existing approaches do not consider the causal time sequence of prediction activity and bankruptcy phenomena. This paper proposes a prediction method using Neyman-Pearson Theorem and Bayes' rule. The proposed method uses posterior probability concept and determines a prediction policy with appropriate error rate.

• Proceedings of the Safety Management and Science Conference
• /
• 2008.11a
• /
• pp.35-39
• /
• 2008

This paper considers the sequencing of products in mixed model assembly lines. The sequence which minimizes overall utility work in car assembly lines reduce the cycle time, the number of utility workers, and the risk of conveyor stopping. The sequencing problem is solved using Tabu Search. Tabu Search is a heuristic method which can provide a near optimal solution in real time. Various examples are presented and experimental results are reported to demonstrate the efficiency of the technique.

• Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
• /
• 2004.05a
• /
• pp.61-66
• /
• 2004

In this paper an effort is made to develop an innovative spatial arrangement concept pertaining to ship building industry. The spatial scheduling is the problem that concentrates on effective planning of available space and arrangements of blocks and in a priority manner. In order to create an effective spatial scheduling. a database providing the priority has to be available to make the erection sequence. Such a system works hand in hand with erection sequence generator program The erection sequence program works on the conventional network analysis method which uses a typical parent-children idea for the calculation of the ENT(possible earliest network start time) and LNT(possible latest network start time). This program works in a cyclic manner taking turns by calculating the ENT in upward trace and LNT on the return trace thereby generating the entire erection sequence diagram for the requisite problem The generated database serves as an input data for spatial scheduling problem. When the system works it takes into consideration the entire system based on heuristic concepts as mentioned. There system uses the spatial aspects such as the available area of the P. E area and plan area of the corresponding blocks and its priority of erection from the erection sequence generator program develops the spatial scheduling arrangement. In this paper using all these concepts an innovative spatial schedule development system developed.