지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
이용수
초록· 키워드
오류제보하기
In this paper, a hybrid genetic algorithm (HGA) approach is proposed for an n-job, m-machine flow shop scheduling problem with limited capacity buffers with blocking in which the objective is to minimize the total stretch. The stretch of a job is the ratio of the amount of time the job spent before its completion to its processing time. HGA adopts the idea of seed selection and development in order to improve the exploitation and exploration power of genetic algorithms (GAs). Extensive computational experiments have been conducted to compare the performance of HGA with that of GA.
목차
1. Introduction
2. Minimization of the Total Stretch in the n-Job, m-Machine Flow Shop with Limited Capacity Buffers
3. Hybrid GA Approach
4. Computational Study
5. Conclusions
References
참고문헌 (18)
참고문헌 신청
1. [학술지(정기간행물)] - Agnetis, A. / 1997 / Batch scheduling in a two-machine flow shop with limited buffer / Discrete Applied Mathematics 72 : 243 ~ 260
2. [학술지(정기간행물)] - Bender, M. A. / 2004 / Approximation algorithms for average stretch scheduling / Journal of Scheduling 7 : 195 ~ 222
3. [학술지(정기간행물)] - Bhattacharyya, S. / 1999 / Direct marketing performance modeling using genetic algorithms / INFORMS Journal on Computing 11 : 248 ~ 257
4. [학술지(정기간행물)] - Chan, W. -T. / 2006 / New resource augmentation analysis of the total stretch of SRPT and SJF in multiprocessor scheduling / Theoretical Computer Science 359 : 430 ~ 439
5. [단행본] - Dreo, J. / 2005 / Metaheuristics for Hard Optimization : Methods and Case Studies / Springer
2. [학술지(정기간행물)] - Bender, M. A. / 2004 / Approximation algorithms for average stretch scheduling / Journal of Scheduling 7 : 195 ~ 222
3. [학술지(정기간행물)] - Bhattacharyya, S. / 1999 / Direct marketing performance modeling using genetic algorithms / INFORMS Journal on Computing 11 : 248 ~ 257
4. [학술지(정기간행물)] - Chan, W. -T. / 2006 / New resource augmentation analysis of the total stretch of SRPT and SJF in multiprocessor scheduling / Theoretical Computer Science 359 : 430 ~ 439
5. [단행본] - Dreo, J. / 2005 / Metaheuristics for Hard Optimization : Methods and Case Studies / Springer
이 논문의 저자 정보
이 논문과 함께 이용한 논문
최근 본 자료
댓글(0)
0
UCI(KEPA) : I410-ECN-0101-2015-500-002819703