지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술저널
- 저자정보
- 발행연도
- 2016.2
- 수록면
- 97 - 103 (7page)
이용수
초록· 키워드
오류제보하기
This paper deals with the cycle time minimization problem that determines the productivity in printed circuit board (PCB) with n components using the m placement machines. This is known as production cycle time determination problem (PCTDP). The polynomial time algorithm to be obtain the optimal solution has been unknown yet, therefore this hard problem classified by NP-complete. This paper gets the initial assignment result with the machine has minimum unit placement time per each component firstly. Then, the balancing process with reallocation from overhead machine to underhead machine. Finally, we perform the swap optimization and get the optimal solution of cycle time T<SUP>*</SUP> within O(mn) computational complexity. For experimental data, the proposed algorithm can be obtain the same result as integer programming+branch-and-bound (IP+B&B) and B&B.
목차
Abstract
Ⅰ. Introduction
Ⅱ. Description and Related Works
Ⅲ. Assignment-Balance-Optimization Algorithm
Ⅳ. Applications and Evaluation
Ⅴ. Conclusions
REFERENCES
참고문헌 (14)
참고문헌 신청
J. C. Ammonds, M. Carlyle, L. Cranmer, G. Depuy, K. Ellis, L. F. McGinnis, C. A. Tovey, and H. Xu, "Component Allocation to Balance Workload in Printed Circuit Card Assembly System," IIE Transactions, Vol. 29, No. 4, pp. 265-275, Apr. 1997.
D. M. Kodek and M. Krisper, "Optimal Algorithm for Minimizing Production Cycle Time of a Printed Circuit Board Assembly Line," International Journal of Production Research, Vol. 42, No. 23, pp. 5031-5048, Dec. 2004.
P. Ji and Y. F. Wan, "Minimizing Cycle Time for PCB Assembly Lines: An Integer Programming Model and a Branch-and-Bound Approach," International Journal of Information and Management Sciences, Vol. 19, No. 2, pp. 237-243, Jun. 2008.
Z. Drezner, and S. Nof, "On Optimizing Bin Picking and Insertion Plans for Assembly Robots," IIE Transactions, Vol. 16, No. 3, pp. 262-270, Jan. 1984.
H. O. Gunther, M. Gronalt, and F. Piller, "Component Knitting in Semi-Automated Printed Circuit Board Assembly," International Journal of Production Economics, Vol. 43, No. 2-3, pp. 213-226, Jun. 1996.
D. M. Kodek and M. Krisper, "Optimal Algorithm for Minimizing Production Cycle Time of a Printed Circuit Board Assembly Line," International Journal of Production Research, Vol. 42, No. 23, pp. 5031-5048, Dec. 2004.
P. Ji and Y. F. Wan, "Minimizing Cycle Time for PCB Assembly Lines: An Integer Programming Model and a Branch-and-Bound Approach," International Journal of Information and Management Sciences, Vol. 19, No. 2, pp. 237-243, Jun. 2008.
Z. Drezner, and S. Nof, "On Optimizing Bin Picking and Insertion Plans for Assembly Robots," IIE Transactions, Vol. 16, No. 3, pp. 262-270, Jan. 1984.
H. O. Gunther, M. Gronalt, and F. Piller, "Component Knitting in Semi-Automated Printed Circuit Board Assembly," International Journal of Production Economics, Vol. 43, No. 2-3, pp. 213-226, Jun. 1996.
함께 읽어보면 좋을 논문
논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!
-
일반화된 할당문제에 대한 시간-비용 최적화 알고리즘
한국정보기술학회논문지
2016 .05
-
단측-최적화 배정과 교환 알고리즘을 적용한 할당문제의 양측-최적화
한국컴퓨터정보학회논문지
2015 .12
-
Q&A
콘크리트학회지
2023 .11
-
Q & A
콘크리트학회지
2020 .05
-
Q & A
콘크리트학회지
2022 .07
-
Q & A
콘크리트학회지
2021 .01
-
Q&A
콘크리트학회지
2022 .03
-
Q & A
콘크리트학회지
2020 .04
-
Q&A
콘크리트학회지
2021 .11
-
Q&A
콘크리트학회지
2022 .11
-
Q & A
콘크리트학회지
2022 .09
-
씨앤에치아이앤씨(주)
대한토목학회지
2021 .12
-
Q & A
콘크리트학회지
2021 .09
-
Q & A
콘크리트학회지
2020 .11
-
Q&A
건축구조
2015 .01
-
Q & A
콘크리트학회지
2020 .07
-
Q & A
콘크리트학회지
2021 .03
-
Q & A
콘크리트학회지
2021 .05
-
Q&A
콘크리트학회지
2022 .05
-
Q & A
콘크리트학회지
2020 .09
이 논문의 저자 정보
최근 본 자료
댓글(0)
0
UCI(KEPA) : I410-ECN-0101-2016-325-002670850