기계 가용성 제약을 고려한 흐름공정 상황하에서 Makespan을 최소화하기 위한 향상된 유전 알고리듬open accessAn Improved Genetic Algorithm to Minimize Makespan in Flowshop with Availability Constraints
- Other Titles
- An Improved Genetic Algorithm to Minimize Makespan in Flowshop with Availability Constraints
- Authors
- 이경화; 정인재
- Issue Date
- Mar-2007
- Publisher
- 한국산업경영시스템학회
- Keywords
- Flowshop scheduling; Machine availability; Schedule generator
- Citation
- 한국산업경영시스템학회지, v.30, no.1, pp.115 - 121
- Indexed
- KCI
- Journal Title
- 한국산업경영시스템학회지
- Volume
- 30
- Number
- 1
- Start Page
- 115
- End Page
- 121
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/180335
- ISSN
- 2005-0461
- Abstract
- In this paper, we study flowshop scheduling problems with availability constraints. In such problems, jobs have to be scheduled on machines sequentially under assumption that the machines are unavailable during some periods of planning horizon. The objective of the problem is to find a non-permutation schedule which minimizes the makespan. As a solution procedure, we propose an improved genetic algorithm which utilizes a look-ahead schedule generator to find good solutions in a reasonable time. Computational experiments show that the proposed genetic algorithm outperforms the existing genetic algorithm.
- Files in This Item
-
- Appears in
Collections - 서울 공과대학 > 서울 산업공학과 > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.