Minimizing the total completion time in a two-stage flexible flow shopopen access2 단계 유연 흐름 생산에서 평균 완료 시간 최소화 문제
- Other Titles
- 2 단계 유연 흐름 생산에서 평균 완료 시간 최소화 문제
- Authors
- 윤석훈
- Issue Date
- Aug-2021
- Publisher
- 중소기업융합학회
- Keywords
- 스케줄링; 유연 흐름 생산; 평균 완료 시간; 혼합 정수 2차 문제; 시뮬레이티드 어닐링; Scheduling; Flexible Flow Shop; Total Completion Time; Mixed Integer Quadratic Programming; Simulated Annealing
- Citation
- 융합정보논문지, v.11, no.8, pp.207 - 211
- Journal Title
- 융합정보논문지
- Volume
- 11
- Number
- 8
- Start Page
- 207
- End Page
- 211
- URI
- http://scholarworks.bwise.kr/ssu/handle/2018.sw.ssu/41556
- DOI
- 10.22156/CS4SMB.2021.11.08.207
- Abstract
- This paper addresses a two-stage flexible flow shop scheduling problem in which there is one machine in stage 1 and two identical machines in stage 2. The objective is the minimization of the total completion time. The problem is formulated by a mixed integer quadratic programming (MIQP) and a hybrid simulated annealing (HSA) is proposed to solve the MIQP. The HSA adopts the exploration capabilities of a genetic algorithm and incorporates a simulated annealing to reduce the premature convergence. Extensive computational tests on randomly generated problems are carried out to evaluate the performance of the HSA.
- Files in This Item
-
Go to Link
- 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.