공구유연성과 공구관련제약을 고려한 통합공정일정계획을 위한 유전알고리즘
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 김영남 | - |
dc.contributor.author | 하정훈 | - |
dc.date.available | 2020-07-10T05:38:00Z | - |
dc.date.created | 2020-07-06 | - |
dc.date.issued | 2017 | - |
dc.identifier.issn | 2005-0461 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/6596 | - |
dc.description.abstract | This paper proposes an improved standard genetic algorithm (GA) of making a near optimal schedule for integrated process planning and scheduling problem (IPPS) considering tool flexibility and tool related constraints. Process planning involves the selection of operations and the allocation of resources. Scheduling, meanwhile, determines the sequence order in which operations are executed on each machine. Due to the high degree of complexity, traditionally, a sequential approach has been preferred, which determines process planning firstly and then performs scheduling independently based on the results. The two sub-problems, however, are complicatedly interrelated to each other, so the IPPS tend to solve the two problems simultaneously. Although many studies for IPPS have been conducted in the past, tool flexibility and capacity constraints are rarely considered. Various meta-heuristics, especially GA, have been applied for IPPS, but the performance is yet satisfactory. To improve solution quality against computation time in GA, we adopted three methods. First, we used a random circular queue during generation of an initial population. It can provide sufficient diversity of individuals at the beginning of GA. Second, we adopted an inferior selection to choose the parents for the crossover and mutation operations. It helps to maintain exploitation capability throughout the evolution process. Third, we employed a modification of the hybrid scheduling algorithm to decode the chromosome of the individual into a schedule, which can generate an active and non-delay schedule. The experimental results show that our proposed algorithm is superior to the current best evolutionary algorithms at most benchmark problems. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | 한국산업경영시스템학회 | - |
dc.title | 공구유연성과 공구관련제약을 고려한 통합공정일정계획을 위한 유전알고리즘 | - |
dc.title.alternative | An Improved Genetic Algorithm for Integrated Planning and Scheduling Algorithm Considering Tool Flexibility and Tool Constraints | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | 하정훈 | - |
dc.identifier.bibliographicCitation | 한국산업경영시스템학회지, v.40, no.2, pp.111 - 120 | - |
dc.relation.isPartOf | 한국산업경영시스템학회지 | - |
dc.citation.title | 한국산업경영시스템학회지 | - |
dc.citation.volume | 40 | - |
dc.citation.number | 2 | - |
dc.citation.startPage | 111 | - |
dc.citation.endPage | 120 | - |
dc.type.rims | ART | - |
dc.identifier.kciid | ART002234777 | - |
dc.description.journalClass | 2 | - |
dc.description.journalRegisteredClass | kci | - |
dc.subject.keywordAuthor | Integrated Process Planning and Scheduling | - |
dc.subject.keywordAuthor | Genetic Algorithm | - |
dc.subject.keywordAuthor | Inferior Selection | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
94, Wausan-ro, Mapo-gu, Seoul, 04066, Korea02-320-1314
COPYRIGHT 2020 HONGIK UNIVERSITY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.