한정된 크기의 버퍼가 있는 흐름 공정 일정계획의 스트레치 최소화
- Authors
- 윤석훈
- Issue Date
- 2014
- Publisher
- 대한산업공학회
- Keywords
- Scheduling; Flow Shop; Stretch; Genetic Algorithms
- Citation
- 대한산업공학회지, v.40, no.6, pp.642 - 647
- Journal Title
- 대한산업공학회지
- Volume
- 40
- Number
- 6
- Start Page
- 642
- End Page
- 647
- URI
- http://scholarworks.bwise.kr/ssu/handle/2018.sw.ssu/10655
- DOI
- 10.7232/JKIIE.2014.40.6.642
- ISSN
- 1225-0988
- Abstract
- 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.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Engineering > Department of Industrial & Information Systems Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.