Integrated process planning and scheduling with minimizing total tardiness in multi-plants supply chain
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Moon, Chiung | - |
dc.contributor.author | Kim, Jongsoo | - |
dc.contributor.author | Hur, Sun | - |
dc.date.accessioned | 2021-06-24T01:02:41Z | - |
dc.date.available | 2021-06-24T01:02:41Z | - |
dc.date.created | 2021-01-21 | - |
dc.date.issued | 2002-07 | - |
dc.identifier.issn | 0360-8352 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/46808 | - |
dc.description.abstract | In this paper, we propose an integrated process planning and scheduling (IPPS) model for the multi-plant supply chain (MSC), which behaves like a single company through strong coordination and cooperation toward mutual goals. The IPPS problem is one of the most important issues for supporting the global objectives, because the function takes part in the assignment of factory resources to production tasks. The problem is formulated as a mathematical model considering alternative machines and sequences, sequence-dependent setup, and distinct due dates. The objective of the model is to decide the schedules for minimizing total tardiness through analysis of the alternative machine selection and the operation sequences in MSC. In order to obtain good approximate solutions, genetic algorithm-based heuristic approach is developed. Numerical experiments are carried out to demonstrate the efficiency of the proposed approach. (C) 2002 Elsevier Science Ltd. All rights reserved. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | Pergamon Press Ltd. | - |
dc.title | Integrated process planning and scheduling with minimizing total tardiness in multi-plants supply chain | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kim, Jongsoo | - |
dc.contributor.affiliatedAuthor | Hur, Sun | - |
dc.identifier.doi | 10.1016/S0360-8352(02)00078-5 | - |
dc.identifier.scopusid | 2-s2.0-0036642688 | - |
dc.identifier.wosid | 000176447900020 | - |
dc.identifier.bibliographicCitation | Computers and Industrial Engineering, v.43, no.1-2, pp.331 - 349 | - |
dc.relation.isPartOf | Computers and Industrial Engineering | - |
dc.citation.title | Computers and Industrial Engineering | - |
dc.citation.volume | 43 | - |
dc.citation.number | 1-2 | - |
dc.citation.startPage | 331 | - |
dc.citation.endPage | 349 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Interdisciplinary Applications | - |
dc.relation.journalWebOfScienceCategory | Engineering, Industrial | - |
dc.subject.keywordAuthor | integrated process planning and scheduling | - |
dc.subject.keywordAuthor | supply chain | - |
dc.subject.keywordAuthor | traveling salesman problem | - |
dc.subject.keywordAuthor | genetic algorithm | - |
dc.identifier.url | https://www.sciencedirect.com/science/article/pii/S0360835202000785?via%3Dihub | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
55 Hanyangdeahak-ro, Sangnok-gu, Ansan, Gyeonggi-do, 15588, Korea+82-31-400-4269 sweetbrain@hanyang.ac.kr
COPYRIGHT © 2021 HANYANG 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.