• 제목/요약/키워드: car sequencing problem

검색결과 8건 처리시간 0.036초

Maximum Options-Equiped Class First-Production Algorithm for Car Sequencing Problem

  • Lee, Sang-Un
    • 한국컴퓨터정보학회논문지
    • /
    • 제20권9호
    • /
    • pp.105-111
    • /
    • 2015
  • This paper suggests O(n) linear-time algorithm for car sequencing problem (CSP) that has been classified as NP-complete because of the polynomial-time algorithm to solve the solution has been unknown yet. This algorithm applies maximum options-equiped car type first production rule to decide the car sequencing of n meet the r:s constraint. This paper verifies thirteen experimental data with the six data are infeasible. For thirteen experimental data, the proposed algorithm can be get the solution for in all cases. And to conclude, This algorithm shows that the CSP is not NP-complete but the P-problem. Also, this algorithm proposes the solving method to the known infeasible cases. Therefore, the proposed algorithm will stand car industrial area in good stead when it comes to finding a car sequencing plan.

자동차 조립라인에서 총 가외작업을 최소로 하는 투입순서 결정 (Sequencing to Minimize the Total Utility Work in Car Assembly Lines)

  • 현철주
    • 대한안전경영과학회지
    • /
    • 제5권1호
    • /
    • pp.69-82
    • /
    • 2003
  • The sequence which minimizes overall utility work in car assembly lines reduces the cycle time, the number of utility workers, and the risk of conveyor stopping. This study suggests mathematical formulation of the sequencing problem to minimize overall utility work, and present a genetic algorithm which can provide a near optimal solution in real time. To apply a genetic algorithm to the sequencing problem in car assembly lines, the representation, selection methods, and genetic parameters are studied. Experiments are carried out to compare selection methods such as roullette wheel selection, tournament selection and ranking selection. Experimental results show that ranking selection method outperforms the others in solution quality, whereas tournament selection provides the best performance in computation time.

준비시간이 있는 혼합모델 조립라인에서 투입순서문제를 위한 탐색적 방법 (Heuristic Method for Sequencing Problem in Mixed Model Assembly Lines with Setup Time)

  • 현철주
    • 대한안전경영과학회:학술대회논문집
    • /
    • 대한안전경영과학회 2008년도 추계학술대회
    • /
    • 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.

  • PDF

가외작업을 최소로 하는 투입순서 결정을 위한 Tabu Search (Tabu Search for Sequencing to Minimize the Utility Work)

  • 현철주
    • 한국품질경영학회:학술대회논문집
    • /
    • 한국품질경영학회 2009년도 추계학술대회
    • /
    • pp.131-135
    • /
    • 2009
  • This paper considers the sequencing of products in car assembly lines. The sequence which minimizes overall utility work in car assembly lines reduce the cycle time 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. The performance of proposed technique is compared with existing heuristic methods in terms of solution quality and computation time. Various examples are presented and experimental results are reported to demonstrate the efficiency of the technique.

  • PDF

자동차 조립라인에서 부품사용의 일정율 유지를 위한 투입순서 결정 (Sequencing to keep a constant rate of part usage in car assembly lines)

  • 현철주
    • 대한안전경영과학회지
    • /
    • 제4권3호
    • /
    • pp.95-105
    • /
    • 2002
  • This paper considers the sequencing of products in car assembly lines under Just-In-Time systems. Under Just-In-Time systems, the most important goal for the sequencing problem is to keep a constant rate of usage every part used by the systems. In this paper, tabu search technique for this problem is proposed. Tabu search is a heuristic method which can provide a near optimal solution in real time. The performance of proposed technique is compared with existing heuristic methods in terms of solution quality and computation time. Various examples are presented and experimental results are reported to demonstrate the efficiency of the technique.

자동차 생산계획 시스템에서 제약만족기법을 이용한 생산 시퀀스 모듈 구현 (Implementation of a Vehicle Production Sequencing Module Using Constraint Satisfaction Technique for Vehicle Production Planning System)

  • 하영훈;우상복;안현식;한형상;박영진
    • 산업공학
    • /
    • 제16권3호
    • /
    • pp.352-361
    • /
    • 2003
  • Vehicle manufacturing plant is a typical mixed-model production system. Generally it consists of three main shops including body shop, painting shop and assembly shop in addition to engine shop. Each shop contains diverse manufacturing processes, all of which are integrated in a form of flow line. Due to the high pressure from the market requesting small-volume large variety production, production planning becomes very critical for the competitiveness of automotive industry. In order to save costs and production time, production planning system is requested to meet some designated requirements for each shop: to balance the work load in body and assembly shops, and to minimize the number of color changes in painting shop. In this context, we developed a sequencing module for a vehicle production planning system using the ILOG Solver Library. It is designed to take into account all the manufacturing constraints at a time with meeting hard constraints in body shop, minimizing the number of soft constraints violated in assembly shop, and minimizing the number of color changes in painting shop.

자동차 페인트 순서 문제의 연속된 최장 구간 색 승리 알고리즘 (Sequential Longest Section Color Winning Algorithm for Car Paint Sequencing Problem)

  • 이상운
    • 한국인터넷방송통신학회논문지
    • /
    • 제20권1호
    • /
    • pp.177-186
    • /
    • 2020
  • 본 논문은 차제가 조립되어 도장공장에 도착한 자동차들을 대상으로 동일한 색으로 최대한 그룹을 형성하여 도장 순서를 결정하는 자동차 페인트 순서 문제를 다룬다. 본 문제는 정확한 해를 다항시간으로 구하는 방법이 알려져 있지 않은 NP-완전으로 난제로 알려져 있다. 도장공장에서는 도장 색이 변경되면 이전 자동차 도장 색 페인트들을 완전히 제거하는 퍼징을 수행해야 하므로, 퍼징 횟수를 최소화시키는 것을 목표로 하고 있다. 본 논문에서는 버퍼에 도착한 자동차들의 이동 가능한 구간인 윈도우 개념에 기반하여 최소의 이동거리와 최소의 퍼징 횟수를 얻을 수 있도록, 자동차들을 동일 색, 도착 순서별로 정렬시키고, 구간 마라톤 경기를 수행하는데 있어 기본적으로는 연속적으로 가장 긴 구간을 차지하는 색 팀이 승리하는 방식을 적용하였다. 다만, 패자 팀이 더 이상 경기를 수행할 수 없는 구간이 존재하는 경우와 패자 팀에게 승리를 양보하고 이후의 경기에서 보다 많은 구간에서 승리하는 경우에는 승리의 우승컵을 해당 패자 팀에 게 양보하여 모든 구간에서 모든 자동차 선수들이 한 번씩은 반드시 승리하는 방식을 적용하였다. 제안된 알고리즘은 n대 자동차에 대해 O(nlogn)의 다항시간 복잡도로 간단하면서도 빠른 장점에도 불구하고, 다양한 사례들에 적용한 결과, 모든 실험 데이터들에 대해 최소의 이동거리와 최소의 퍼징 횟수를 얻을 수 있었다.