Show simple item record

dc.contributor.authorYing, Kuo-Ching
dc.contributor.authorPourhejazy, Pourya
dc.contributor.authorFu, Po-Jiu
dc.date.accessioned2023-08-31T12:04:53Z
dc.date.available2023-08-31T12:04:53Z
dc.date.issued2023-07-04
dc.description.abstractSystem-wide optimization of distributed manufacturing operations enables process improvement beyond the standalone and individual optimality norms. This study addresses the production planning of a distributed manufacturing system consisting of three stages: production of parts (subcomponents), assembly of components in Original Equipment Manufacturer (OEM) factories, and final assembly of products at the product manufacturer’s factory. Distributed Three Stage Assembly Permutation Flowshop Scheduling Problems (DTrSAPFSP) models this operational situation; it is the most recent development in the literature of distributed scheduling problems, which has seen very limited development for possible industrial applications. This research introduces a highly efficient constructive heuristic to contribute to the literature on DTrSAPFSP. Numerical experiments considering a comprehensive set of operational parameters are undertaken to evaluate the performance of the benchmark algorithms. It is shown that the N-list-enhanced Constructive Heuristic algorithm performs significantly better than the current best-performing algorithm and three new metaheuristics in terms of both solution quality and computational time. It can, therefore, be considered a competitive benchmark for future studies on distributed production scheduling and computing.en_US
dc.identifier.citationYing K, Pourhejazy P, Fu. N-list-enhanced heuristic for distributed three-stage assembly permutation flow shop scheduling. Annals of Operations Research. 2023en_US
dc.identifier.cristinIDFRIDAID 2157439
dc.identifier.doi10.1007/s10479-023-05456-6
dc.identifier.issn0254-5330
dc.identifier.issn1572-9338
dc.identifier.urihttps://hdl.handle.net/10037/30597
dc.language.isoengen_US
dc.publisherSpringeren_US
dc.relation.journalAnnals of Operations Research
dc.rights.accessRightsopenAccessen_US
dc.rights.holderCopyright 2023 The Author(s)en_US
dc.rights.urihttps://creativecommons.org/licenses/by/4.0en_US
dc.rightsAttribution 4.0 International (CC BY 4.0)en_US
dc.titleN-list-enhanced heuristic for distributed three-stage assembly permutation flow shop schedulingen_US
dc.type.versionpublishedVersionen_US
dc.typeJournal articleen_US
dc.typeTidsskriftartikkelen_US
dc.typePeer revieweden_US


File(s) in this item

Thumbnail

This item appears in the following collection(s)

Show simple item record

Attribution 4.0 International (CC BY 4.0)
Except where otherwise noted, this item's license is described as Attribution 4.0 International (CC BY 4.0)