Variable neighborhood search algorithms for flow shop scheduling with reworks under overlapped queue time limits: minimizing total tardiness
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 이동호 | - |
dc.date.accessioned | 2023-08-16T08:51:16Z | - |
dc.date.available | 2023-08-16T08:51:16Z | - |
dc.date.created | 2023-08-12 | - |
dc.date.issued | 2023-08-10 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/189366 | - |
dc.publisher | International Federation on Logistics and SCM Systems (IFLS) | - |
dc.title | Variable neighborhood search algorithms for flow shop scheduling with reworks under overlapped queue time limits: minimizing total tardiness | - |
dc.type | Conference | - |
dc.contributor.affiliatedAuthor | 이동호 | - |
dc.identifier.bibliographicCitation | International Congress on Logistics and SCM Systems (ICLS2023) | - |
dc.relation.isPartOf | International Congress on Logistics and SCM Systems (ICLS2023) | - |
dc.citation.title | International Congress on Logistics and SCM Systems (ICLS2023) | - |
dc.citation.conferencePlace | 대한상공회의소, Seoul | - |
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.