조립라인의 평준화를 위한 차량 투입 순서 결정에 관한 연구

Abstract

다양한 차종이나 사양의 차량들을 혼류생산하는 대부분의 혼합모형 조립라인에서는 일일 차량투입순서계획 시에 차체라인과 의장라인의 부하평준화와 부품소비율의 평준화를 고려하고 있다. 본 논문에서는 평준화 뿐만 아니라 상도공정의 컬러 그룹핑을 고려함으로써 도장공장에서의 색상변경비용을 줄여 조립라인의 전체 효율성을 높이고자 한다. 이 연구에서는 평준화된 일일 순서계획이 주어진 경우에 도장공장의 컬러 그룹핑을 고려하는 알고리즘과 이 알고리즘을 적용한 시뮬레이션 결과를 제시한다.

This paper deals with the problem of determining the sequence schedule for producing a variety of automobiles on the mixed-model assembly line. The sequence may vary depending on the following goals;

1. Levelling the load on each station on the line.

2. Keeping a constant rate of usage of every part used by the line.

In addition to these two goals, this paper also coniders the goal of reducing the color change cost on the painting shop.

A simple algorithm for sequencing automobiles on the assembly line is developed and some computaional results of the performance by this algorithm are provided.

This paper deals with the problem of determining the sequence schedule for producing a variety of automobiles on the mixed-model assembly line. The sequence may vary depending on the following goals;

1. Levelling the load on each station on the line.

2. Keeping a constant rate of usage of every part used by the line.

In addition to these two goals, this paper also coniders the goal of reducing the color change cost on the painting shop.

A simple algorithm for sequencing automobiles on the assembly line is developed and some computaional results of the performance by this algorithm are provided.