지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술저널
- 저자정보
- 저널정보
- 대한산업공학회 Industrial Engineering & Management Systems Industrial Engineering & Management Systems 제12권 제4호
- 발행연도
- 2013.12
- 수록면
- 306 - 316 (11page)
이용수
초록· 키워드
오류제보하기
The semiconductor industry has grown rapidly, and subsequently production planning problems have raised many important research issues. The reentrant flow-shop (RFS) scheduling problem with time windows constraint for harddisk devices (HDD) manufacturing is one such problem of the expanded semiconductor industry. The RFS scheduling problem with the objective of minimizing the makespan of jobs is considered. Meeting this objective is directly related to maximizing the system throughput which is the most important of HDD industry requirements. Moreover, most manufacturing systems have to handle the quality of semiconductor material. The time windows constraint in the manufacturing system must then be considered. In this paper, we propose a hybrid genetic algorithm (HGA) for improving chromosomes/offspring by checking and repairing time window constraint and improving offspring by leftshift routines as a local search algorithm to solve effectively the RFS scheduling problem with time windows constraint. Numerical experiments on several problems show that the proposed HGA approach has higher search capability to improve quality of solutions.
목차
ABSTRACT
1. INTRODUCTION
2. LITERATURE REVIEW
3. HYBRID REENTRANT MODEL IN HDD MANUFACTURING SYSTEM
4. HYBRID GENETIC ALGORITHM
5. EXPERIMENTAL RESEARCH
6. CONCLUSION
REFERENCES
참고문헌 (23)
참고문헌 신청
1. [학술대회논문] - Abe, K. / 2008 / Genetic local search method for re-entrant flow shop problem / Proceedings of the Artificial Neural Networks in Engineering Conference : 381 ~ 387
2. [학술대회논문] - Chamnanlor, C. / 2009 / Mixed integer programming models for scheduling hybrid flowshop with unrelated machines and time windows constraints / Proceedings of the 10th Asia Pacific Industrial Engineering and Management System Conference : 2331 ~ 2335
3. [학술지(정기간행물)] - Chen, J. S. / 2008 / A hybrid genetic algorithm for the re-entrant flow-shop scheduling problem / Expert Systems with Applications 34 (1) : 570 ~ 577
4. [학술지(정기간행물)] - Chen, J. S. / 2007 / Minimizing makespan in reentrant flow-shops using hybrid tabu search / International Journal of Advanced Manufacturing Technology 34 (3/4) : 353 ~ 361
5. [학술지(정기간행물)] - Chen, J. S. / 2008 / Hybrid tabu search for re-entrant permutation flowshop scheduling problem / Expert Systems with Applications 34 (3) : 1924 ~ 1930
2. [학술대회논문] - Chamnanlor, C. / 2009 / Mixed integer programming models for scheduling hybrid flowshop with unrelated machines and time windows constraints / Proceedings of the 10th Asia Pacific Industrial Engineering and Management System Conference : 2331 ~ 2335
3. [학술지(정기간행물)] - Chen, J. S. / 2008 / A hybrid genetic algorithm for the re-entrant flow-shop scheduling problem / Expert Systems with Applications 34 (1) : 570 ~ 577
4. [학술지(정기간행물)] - Chen, J. S. / 2007 / Minimizing makespan in reentrant flow-shops using hybrid tabu search / International Journal of Advanced Manufacturing Technology 34 (3/4) : 353 ~ 361
5. [학술지(정기간행물)] - Chen, J. S. / 2008 / Hybrid tabu search for re-entrant permutation flowshop scheduling problem / Expert Systems with Applications 34 (3) : 1924 ~ 1930
이 논문의 저자 정보
이 논문과 함께 이용한 논문
최근 본 자료
댓글(0)
0
UCI(KEPA) : I410-ECN-0101-2015-500-001071972