Detailed Information
Cited 0 time in 
Cited 0 time in 
Cited 0 time in
Metadata Downloads
Minimizing the Total Stretch in Flow Shop Scheduling
- Authors
- 윤석훈
- Issue Date
- Nov-2014
- Publisher
- 한국경영과학회
- Keywords
- Scheduling; Flow Shop; Stretch; Genetic Algorithms
- Citation
- MSFE, v.20, no.2, pp.33 - 37
- Journal Title
- MSFE
- Volume
- 20
- Number
- 2
- Start Page
- 33
- End Page
- 37
- ISSN
- 2287-2043
- Abstract
- 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).
- Files in This Item
- Go to Link
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.