RISS 학술연구정보서비스

검색

인기 검색어

    다국어 입력

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

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

    예시)
    • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
    • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
    닫기
    KCI등재

    PCB 삽입 경로 및 부품함 위치 배정 연구 = A Study of Inserting Sequence and Feeder Allocation Problem on Printed Circuit Board

    한글로보기

    https://www.riss.kr/link?id=A30080287

    • 0

      상세조회
    • 0

      다운로드
    서지정보 열기
    • 내보내기
    • 내책장담기
    • 공유하기
    • 오류접수

    부가정보

    다국어 초록 (Multilingual Abstract) kakao i 다국어 번역

    In this paper, we try to raise the efficiency of PCB production by improving automated inserting process. This process is composed of part inserting sequence and feeder allocation problem. Until now, this problem is formulated by Traveling Salesman Problem(TSP) or Rural Postman Problem. They concetrated more on parts(chips) inserting. But in this paper, we concentrate on Feeder. We formulate 0-1 Integer program(MP2) easier than TSP. This program can be solved by using LP Package(i.e. LINDO, GAMS etc). We propose Heuristic algorithm ISFA which guarantees a local optimum and often gives optimal solution. We give some examples to prove ISFA algorithm.
    번역하기

    In this paper, we try to raise the efficiency of PCB production by improving automated inserting process. This process is composed of part inserting sequence and feeder allocation problem. Until now, this problem is formulated by Traveling Salesman Pr...

    In this paper, we try to raise the efficiency of PCB production by improving automated inserting process. This process is composed of part inserting sequence and feeder allocation problem. Until now, this problem is formulated by Traveling Salesman Problem(TSP) or Rural Postman Problem. They concetrated more on parts(chips) inserting. But in this paper, we concentrate on Feeder. We formulate 0-1 Integer program(MP2) easier than TSP. This program can be solved by using LP Package(i.e. LINDO, GAMS etc). We propose Heuristic algorithm ISFA which guarantees a local optimum and often gives optimal solution. We give some examples to prove ISFA algorithm.

    더보기

    분석정보

    View

    상세정보조회

    0

    Usage

    원문다운로드

    0

    대출신청

    0

    복사신청

    0

    EDDS신청

    0

    동일 주제 내 활용도 TOP

    더보기

    주제

    연도별 연구동향

    연도별 활용동향

    연관논문

    연구자 네트워크맵

    공동연구자 (7)

    유사연구자 (20) 활용도상위20명

    이 자료와 함께 이용한 RISS 자료

    나만을 위한 추천자료

    해외이동버튼