지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술저널
- 저자정보
- 저널정보
- 한국경영과학회 Management Science and Financial Engineering Management Science and Financial Engineering Vol.20 No.2
- 발행연도
- 2014.11
- 수록면
- 33 - 37 (5page)
이용수
초록· 키워드
오류제보하기
A flow shop scheduling problem involves scheduling jobs on multiple machines in series in order to optimize a given criterion. The flow time of a job is the amount of time the job spent before its completion and the stretch of the job is the ratio of its flow time to its processing time. In this paper, a hybrid genetic algorithm (HGA) approach is proposed for minimizing the total stretch in flow shop scheduling. HGA adopts the idea of seed selection and development in order to reduce the chance of premature convergence that may cause the loss of search power. The performance of HGA is compared with that of genetic algorithms (GAs).
목차
ABSTRACT
1. INTRODUCTION
2. MINIMIZATION OF THE TOTAL STRETCH IN THE n-JOB, m-MACHINE FLOW SHOP
3. HYBRID GA APPROACH
4. COMPUTATIONAL STUDY
5. CONCLUSIONS
REFERENCES
참고문헌 (10)
참고문헌 신청
1. [단행본] - Baker, K. R / 2009 / Principle of Sequencing and Scheduling / Wiley
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-320-002858013