RISS 학술연구정보서비스

검색
다국어 입력

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

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

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

    RISS 인기검색어

      KCI등재

      AGV 투입간격을 고려한 Flow Shop형 FMS의 최적 작업순서 결정 = Determination of the Optimal Job Sequence on the Flow-Shop Type FMS Considering the AGV`s Entering Interval

      한글로보기

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

      • 0

        상세조회
      • 0

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

      부가정보

      다국어 초록 (Multilingual Abstract)

      The purpose of this paper is to improve the operation performance of unit-load Automated Guided Vehicles (AGVs) used as a carrier and mobile workstation in a flow-shop type flexible manufacturing system.
      An algorithm is developed to determine the optimal job sequence which minimizes the vehicle idle time on the line and the production makespan by the use of the entering interval and travel time between workcenters. An entering times of AGVs and the minimum number of AGVs required are calculated by optimal job sequence.
      When the number of AGVs is limited, entering times of AGVs are adjusted to maximize the efficient use of vehicles. A numerical example is given to illustrate the application of the algorithm.
      번역하기

      The purpose of this paper is to improve the operation performance of unit-load Automated Guided Vehicles (AGVs) used as a carrier and mobile workstation in a flow-shop type flexible manufacturing system. An algorithm is developed to determine the opt...

      The purpose of this paper is to improve the operation performance of unit-load Automated Guided Vehicles (AGVs) used as a carrier and mobile workstation in a flow-shop type flexible manufacturing system.
      An algorithm is developed to determine the optimal job sequence which minimizes the vehicle idle time on the line and the production makespan by the use of the entering interval and travel time between workcenters. An entering times of AGVs and the minimum number of AGVs required are calculated by optimal job sequence.
      When the number of AGVs is limited, entering times of AGVs are adjusted to maximize the efficient use of vehicles. A numerical example is given to illustrate the application of the algorithm.

      더보기

      동일학술지(권/호) 다른 논문

      분석정보

      View

      상세정보조회

      0

      Usage

      원문다운로드

      0

      대출신청

      0

      복사신청

      0

      EDDS신청

      0

      동일 주제 내 활용도 TOP

      더보기

      주제

      연도별 연구동향

      연도별 활용동향

      연관논문

      연구자 네트워크맵

      공동연구자 (7)

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

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

      나만을 위한 추천자료

      해외이동버튼