Bi-objective Scheduling for Reentrant Hybrid Flow Shop: Application to a TFT-LCD Manufacturing
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 정인재 | - |
dc.date.accessioned | 2021-08-04T00:38:10Z | - |
dc.date.available | 2021-08-04T00:38:10Z | - |
dc.date.created | 2021-06-30 | - |
dc.date.issued | 2007-11-04 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/66080 | - |
dc.description.abstract | This article proposes local search based pareto genetic algorithms to solve the biobjective scheduling problem to minimize makespan and total tardiness for a reentrant hybrid flowshop. The pareto genetic algorithms are compared with existing dispatching rules under a variety of experimental conditions. We also compare the performance of the proposed genetic algorithms with that of a commercial scheduling software based on real scheduling data provided by a TFTLCD factory in Korea. | - |
dc.publisher | INFORMS | - |
dc.title | Bi-objective Scheduling for Reentrant Hybrid Flow Shop: Application to a TFT-LCD Manufacturing | - |
dc.type | Conference | - |
dc.contributor.affiliatedAuthor | 정인재 | - |
dc.identifier.bibliographicCitation | INFORMS Annual Meeting | - |
dc.relation.isPartOf | INFORMS Annual Meeting | - |
dc.citation.title | INFORMS Annual Meeting | - |
dc.citation.conferencePlace | Seattle, USA | - |
dc.type.rims | CONF | - |
dc.description.journalClass | 1 | - |
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.