RISS 학술연구정보서비스

검색
다국어 입력

http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

변환된 중국어를 복사하여 사용하시면 됩니다.

예시)
  • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
  • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
닫기
    인기검색어 순위 펼치기

    RISS 인기검색어

      검색결과 좁혀 보기

      선택해제

      오늘 본 자료

      • 오늘 본 자료가 없습니다.
      더보기
      • 무료
      • 기관 내 무료
      • 유료
      • KCI등재

        MIXED ASSEMBLY LINE REBALANCING: A BINARY INTEGER APPROACH APPLIED TO REAL WORLD PROBLEMS IN THE AUTOMOTIVE INDUSTRY

        F. S. OLIVEIRA,K. VITTORI,R. M. O. RUSSEL,X. L. TRAVASSOS 한국자동차공학회 2012 International journal of automotive technology Vol.13 No.6

        Industrial organizations have increasingly sought to optimize the resources needed for the manufacture of its products from the competition, in order to maintain their profit margins. The search for balance of resources and balanced distribution of tasks in various types of industrial environments is called balancing. When adjustments are made and adequacy of an assembly line that is already in operation, this process is called rebalancing. This paper presents a case study involving a problem of rebalancing of automotive assembly line in an environment of arbitrarily mixed models of products, also known as mix. The proposed procedure for solving the rebalancing in the company in question is based on Binary Integer Programming, in particular the branch and bound algorithm. For comparison, we used a heuristic method based on precedence diagrams for solving the rebalancing of lines. To evaluate the results obtained between the two procedures were used performance indicators such as number of workstations created, average load of work and level of unbalance. The proposed algorithm has resulted in significant improvements in the production line capacity.

      연관 검색어 추천

      이 검색어로 많이 본 자료

      활용도 높은 자료

      해외이동버튼