ub.xmlui.mirage2.page-structure.muninLogoub.xmlui.mirage2.page-structure.openResearchArchiveLogo
    • EnglishEnglish
    • norsknorsk
  • Velg spraakEnglish 
    • EnglishEnglish
    • norsknorsk
  • Administration/UB
View Item 
  •   Home
  • Fakultet for ingeniørvitenskap og teknologi
  • Institutt for industriell teknologi
  • Artikler, rapporter og annet (industriell teknologi)
  • View Item
  •   Home
  • Fakultet for ingeniørvitenskap og teknologi
  • Institutt for industriell teknologi
  • Artikler, rapporter og annet (industriell teknologi)
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Meta-Lamarckian-based iterated greedy for optimizing distributed two-stage assembly flowshops with mixed setups

Permanent link
https://hdl.handle.net/10037/24766
DOI
https://doi.org/10.1007/s10479-022-04537-2
Thumbnail
View/Open
article.pdf (754.2Kb)
Accepted manuscript version (PDF)
Date
2022-02-03
Type
Journal article
Tidsskriftartikkel
Peer reviewed

Author
Pourhejazy, Pourya; Cheng, Chen-Yang; Ying, Kuo-Ching; Nam, Nguyen Hoai
Abstract
Integrated 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.
Publisher
Springer
Citation
Pourhejazy, Cheng, Ying, Nam. Meta-Lamarckian-based iterated greedy for optimizing distributed two-stage assembly flowshops with mixed setups. Annals of Operations Research. 2022
Metadata
Show full item record
Collections
  • Artikler, rapporter og annet (industriell teknologi) [195]
Copyright 2022 The Author(s)

Browse

Browse all of MuninCommunities & CollectionsAuthor listTitlesBy Issue DateBrowse this CollectionAuthor listTitlesBy Issue Date
Login

Statistics

View Usage Statistics
UiT

Munin is powered by DSpace

UiT The Arctic University of Norway
The University Library
uit.no/ub - munin@ub.uit.no

Accessibility statement (Norwegian only)