지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술대회자료
- 저자정보
- 발행연도
- 2014.2
- 수록면
- 651 - 656 (6page)
이용수
초록· 키워드
오류제보하기
Assembly line balancing problem (ALBP) is initially present in the assembly line or off the assembly line in the configuration occurs when relocating . Assembly tasks ALBP workshop is divided into decision-making for the balance of the entire line of questions. Last simple assembly line balancing problem (SALBP) can be solved efficiently and quickly focus on Heuristic research methodology have been conducted . On the other hand, reflecting the realistic conditions of SALBP research work have been introduced in the prior relationship between the relational constraints (Precedence restriction) Heuristic solution is only considered to be limited.
In this paper, we propose to introduce a constraint that was allocated that can reflect all of five new assignment constraints and Graph Theory proposed to assign to the workshop on the basis of five tasks can be modeled by assigning constraints methodologies proposed. Defined by the modeling methodology proposed work to address the limitations of the SALBP and further generalized assembly line balancing (GALBP) can solve the problem.
In this paper, we propose to introduce a constraint that was allocated that can reflect all of five new assignment constraints and Graph Theory proposed to assign to the workshop on the basis of five tasks can be modeled by assigning constraints methodologies proposed. Defined by the modeling methodology proposed work to address the limitations of the SALBP and further generalized assembly line balancing (GALBP) can solve the problem.
목차
ABSTRACT
1. 서론
2. 접근 방법
3. 모델링 방법론
4. 적용 예제
4. 결론
참고문헌
참고문헌 (0)
참고문헌 신청이 논문의 저자 정보
이 논문과 함께 이용한 논문
최근 본 자료
댓글(0)
0
UCI(KEPA) : I410-ECN-0101-2015-500-002695569