Show simple item record

dc.contributor.authorPourhejazy, Pourya
dc.contributor.authorCheng, Chen-Yang
dc.contributor.authorYing, Kuo-Ching
dc.contributor.authorNam, Nguyen Hoai
dc.date.accessioned2022-04-12T09:19:50Z
dc.date.available2022-04-12T09:19:50Z
dc.date.issued2022-02-03
dc.description.abstractIntegrated scheduling of distributed manufacturing operations has implications for supply chain optimization and requires further investigations to facilitate its application area for various industry settings. This study extends the limited literature of the distributed two-stage production-assembly scheduling problems offering a twofold contribution. First, an original mathematical extension, the Distributed Two-Stage Assembly Flowshop Scheduling Problem with Mixed Setups (DTSAFSP-MS) is investigated to integrate setup time constraints while addressing an overlooked scheduling assumption. Second, a novel extension to the Iterated Greedy algorithm is developed to solve this understudied scheduling problem. An extensive set of test instances is considered to evaluate the effectiveness of the developed solution algorithm comparing it with the current-best-performing algorithm in the literature. Results are supportive of the Meta-Lamarckian-based Iterated Greedy (MIG) as a strong benchmark algorithm for solving DTSAFSP-MS with the statistical tests confirming its meaningfully better performance compared to the state-of-the-art.en_US
dc.identifier.citationPourhejazy, Cheng, Ying, Nam. Meta-Lamarckian-based iterated greedy for optimizing distributed two-stage assembly flowshops with mixed setups. Annals of Operations Research. 2022en_US
dc.identifier.cristinIDFRIDAID 1997331
dc.identifier.doi10.1007/s10479-022-04537-2
dc.identifier.issn0254-5330
dc.identifier.issn1572-9338
dc.identifier.urihttps://hdl.handle.net/10037/24766
dc.language.isoengen_US
dc.publisherSpringeren_US
dc.relation.journalAnnals of Operations Research
dc.rights.accessRightsopenAccessen_US
dc.rights.holderCopyright 2022 The Author(s)en_US
dc.titleMeta-Lamarckian-based iterated greedy for optimizing distributed two-stage assembly flowshops with mixed setupsen_US
dc.type.versionacceptedVersionen_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