Flow shop scheduling with no-wait flexible lot streaming using adaptive genetic algorithm
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Kwanwoo | - |
dc.contributor.author | Jeong, In Jae | - |
dc.date.accessioned | 2022-12-21T06:52:49Z | - |
dc.date.available | 2022-12-21T06:52:49Z | - |
dc.date.created | 2022-09-16 | - |
dc.date.issued | 2007-08 | - |
dc.identifier.issn | 0000-0000 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/179728 | - |
dc.description.abstract | In this paper, we propose a flow shop scheduling problem with no-wait flexible lot streaming. The problem involves the splitting of order quantities of different products into sublots and the consideration of alternative machines with different processing times. Sublots of a particular product are not allowed to intermingle, that is sublots of different products must be no-preemptive. The objective of the problem is the minimization of makespan. An adaptive genetic algorithm is proposed which is composed of three main steps: first step is a position-based crossover of products and four kinds of local search-based mutations to generate better generations. Second step is an iterative hill-climbing to improve the current generation. The last step is the adaptive regulation of crossover and mutation rates. Experimental results are presented for various sizes of problems to describe the performance of the proposed four local search-based mutations in adaptive algorithm | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | ICCSA | - |
dc.title | Flow shop scheduling with no-wait flexible lot streaming using adaptive genetic algorithm | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Jeong, In Jae | - |
dc.identifier.doi | 10.1109/ICCSA.2007.45 | - |
dc.identifier.scopusid | 2-s2.0-48049090895 | - |
dc.identifier.bibliographicCitation | Proceedings - The 2007 International Conference on Computational Science and its Applications, ICCSA 2007, pp.474 - 479 | - |
dc.relation.isPartOf | Proceedings - The 2007 International Conference on Computational Science and its Applications, ICCSA 2007 | - |
dc.citation.title | Proceedings - The 2007 International Conference on Computational Science and its Applications, ICCSA 2007 | - |
dc.citation.startPage | 474 | - |
dc.citation.endPage | 479 | - |
dc.type.rims | ART | - |
dc.type.docType | Conference Paper | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordPlus | Algorithms | - |
dc.subject.keywordPlus | Diesel engines | - |
dc.subject.keywordPlus | Genetic algorithms | - |
dc.subject.keywordPlus | Machine shop practice | - |
dc.subject.keywordPlus | Optimization | - |
dc.subject.keywordPlus | Scheduling | - |
dc.subject.keywordPlus | Stream flow | - |
dc.subject.keywordPlus | Adaptive genetic algorithm | - |
dc.subject.keywordPlus | Adaptive regulation | - |
dc.subject.keywordPlus | Computational sciences | - |
dc.subject.keywordPlus | Crossover and mutation | - |
dc.subject.keywordPlus | Current generation | - |
dc.subject.keywordPlus | Flow-shop scheduling | - |
dc.subject.keywordPlus | Flowshop-scheduling problems | - |
dc.subject.keywordPlus | Hill-climbing | - |
dc.subject.keywordPlus | International conferences | - |
dc.subject.keywordPlus | Local search | - |
dc.subject.keywordPlus | Lot streaming | - |
dc.subject.keywordPlus | Makespan | - |
dc.subject.keywordPlus | No-wait | - |
dc.subject.keywordPlus | Processing times | - |
dc.subject.keywordPlus | Adaptive algorithms | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/4301184 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1365
COPYRIGHT © 2021 HANYANG UNIVERSITY.
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.