• 산업경영시스템학회지
• /
• 제41권2호
• /
• pp.105-116
• /
• 2018

In this study, we consider the assembly line balancing (ALB) problem which is known as an very important decision dealing with the optimal design of assembly lines. We consider ALB problems with soft constraints which are expected to be fulfilled, however they are not necessarily to be satisfied always and they are difficult to be presented in exact quantitative forms. In previous studies, most researches have dealt with hard constraints which should be satisfied at all time in ALB problems. In this study, we modify the mixed integer programming model of the problem introduced in the existing study where the problem was first considered. Based on the modified model, we propose a new algorithm using the genetic algorithm (GA). In the algorithm, new features like, a mixed initial population selection method composed of the random selection method and the elite solutions of the simple ALB problem, a fitness evaluation method based on achievement ratio are applied. In addition, we select the genetic operators and parameters which are appropriate for the soft assignment constraints through the preliminary tests. From the results of the computational experiments, it is shown that the proposed algorithm generated the solutions with the high achievement ratio of the soft constraints.

• 대한산업공학회지
• /
• 제23권3호
• /
• pp.515-532
• /
• 1997

When balancing mixed model assembly lines (MMALs), workload smoothness should be considered on the model-by-model basis as well as on the station-by-station basis. This is because although station-by-station assignments may provide the equality of workload to workers, it causes the utilization of assembly lines to be inefficient due to the model sequences. This paper presents a genetic algorithm to improve the workload smoothness on both the station-by-station and the model-by-model basis in balancing MMALs. Proposed is a function by which the two kinds of workloads smoothness can be evaluated according to the various preferences of line managers. To enhance the capability of searching good solutions, our genetic algorithm puts emphasis on the utilization of problem-specific information and heuristics in the design of representation scheme and genetic operators. Experimental results show that our algorithm can provide better solutions than existing heuristics. In particular, our algorithm is outstanding on the problems with a larger number of stations or a larger number of tasks.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1994년도 춘계공동학술대회논문집; 창원대학교; 08월 09일 Apr. 1994
• /
• pp.647-647
• /
• 1994

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1994년도 추계학술발표회 발표논문집; 연세대학교경영관, 서울; 8 Oct. 1994
• /
• pp.224-231
• /
• 1994

• 대한산업공학회지
• /
• 제20권3호
• /
• pp.15-34
• /
• 1994

This paper considers the genetic algorithms(GAs) for the mixed model assembly line sequencing(MMALS) in which the objective is to minimize the overall line length. To apply the GAs to the MMALS, the representation, selection, genetic sequencing operators, and genetic parameters are studied. Especially, the existing sequencing binary operators such as partially map crossover(PMX), cycle crossover(CX), and order crossover (OX) are modified to be suitable for the MMALS, and a new sequencing binary operator called immediate successor relationship crossover (ISR) is introduced. These binary operators mentioned above and/or unary operators such as swap, insertion, inversion, displacement, and splice are compared to find operators which work well in the MMALS. Experimental results indicate that 1) among the binary operators ISR operator is the best, followed by the modified OX, and the modified PMX, with the modified CX being the worst, 2) among the unary operators inversion operator is the best, followed by displacement, swap, and insertion, with splice being the worst, and 3) in general, the unary operators perform better than the binary operators for the MMALS.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1992년도 춘계공동학술대회 발표논문 및 초록집; 울산대학교, 울산; 01월 02일 May 1992
• /
• pp.159-168
• /
• 1992

생산라인의 line balancing이 흐름생산에 있어서 일관된 생산을 하기 위한 필수조건이다. 여러 다양한 제품을 생산하는 printed circuit board(PCB) 공장에서의 line balancing을 얻기 위해서는 mixed model line balancing절차를 설명하고자 한다.

• 대한산업공학회지
• /
• 제25권3호
• /
• pp.310-320
• /
• 1999

A mixed model assembly line (MMAL) is a special type of production line where a variety of product models similar in product characteristics are assembled. Determining the model sequence is an important problem for the efficient use of MMALs. This paper considers interactive multiobjective decision making problems for MMAL sequencing. Evolution program is employed as an underlying framework. In this study, a way of approximating the linear utility function is first studied. To improve its search efficiency to the solution space preferred by a decision maker, some modifications of a standard evolution program are made: operating several subpopulations instead of a single population and merging two or more subpopulations to a single subpopulation, and using a Pareto pool. Extensive computational experiments are carried out to verify the performance of the proposed approach. The computational results show that our approach is promising in solution quality.

• 대한안전경영과학회:학술대회논문집
• /
• 대한안전경영과학회 2005년도 춘계학술대회
• /
• pp.523-534
• /
• 2005

This paper is concerned with the integrated problem of line balancing and model sequencing in mixed model assembly lines(MMALBS), which is important to efficient utilization of the lines. In the problem, we deal with the objective of minimizing the overall line length To apply the GAs to MMALBS problems, we suggest a GA representation which suitable for its problems, an efficient decoding technique for the objective, and genetic operators which produce feasible offsprings. Extensive experiments are carried out to analyze the performance of the proposed algorithm. The computational results show that our algorithm is promising in solution quality.

• 산업공학
• /
• 제18권2호
• /
• pp.136-147
• /
• 2005

This paper introduces a simulation study regarding the operation of the Painted Body Storage (PBS) in an automobile factory. In the paint shop of the factory, same colored bodies are grouped together in order to increase the effectiveness of process, for example decrease the loss of cleaning the painting-gun when the color of body changes from one to another. However the production of automobiles in the assembly shop is a typical example of the mixed model assembly production. Therefore PBS locates between the paint shop and the assembly shop for control the input sequence of bodies to the assembly shop, and it enables to meet the smoothing requirement of assembly sequence. There are highly restricted constraints on the assembly sequence in a assembly shop. Those are spacing restriction and smoothing restriction. If such restrictions are violated, conveyor-stop or utility work will be necessary. Thus the major objective of PBS is to control the assembly sequence in a way to meet the two restrictions. In this paper a case study of PBS in an automotive factory is introduced. The storage/retrieval algorithms are suggested and the proposed system is verified using simulation models. Sensitivity analysis for operating factors is also conducted.

• 산업공학
• /
• 제13권2호
• /
• pp.204-210
• /
• 2000

This paper deals with the problem of mixed-model sequencing on an assembly line. In this sequencing problem we want to minimize the risk of the conveyor stoppage and the total utility work. This paper applies genetic algorithm to solve the mixed-model sequencing problem which is formulated as an integer programming. The solution we get from this algorithm is compared with the solution of Tsai(1995)'s.