ub.xmlui.mirage2.page-structure.muninLogoub.xmlui.mirage2.page-structure.openResearchArchiveLogo
    • EnglishEnglish
    • norsknorsk
  • Velg spraaknorsk 
    • EnglishEnglish
    • norsknorsk
  • Administrasjon/UB
Vis innførsel 
  •   Hjem
  • Fakultet for ingeniørvitenskap og teknologi
  • Institutt for industriell teknologi
  • Artikler, rapporter og annet (industriell teknologi)
  • Vis innførsel
  •   Hjem
  • Fakultet for ingeniørvitenskap og teknologi
  • Institutt for industriell teknologi
  • Artikler, rapporter og annet (industriell teknologi)
  • Vis innførsel
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 lenke
https://hdl.handle.net/10037/24766
DOI
https://doi.org/10.1007/s10479-022-04537-2
Thumbnail
Åpne
article.pdf (754.2Kb)
Akseptert manusversjon (PDF)
Dato
2022-02-03
Type
Journal article
Tidsskriftartikkel
Peer reviewed

Forfatter
Pourhejazy, Pourya; Cheng, Chen-Yang; Ying, Kuo-Ching; Nam, Nguyen Hoai
Sammendrag
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.
Forlag
Springer
Sitering
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
Vis full innførsel
Samlinger
  • Artikler, rapporter og annet (industriell teknologi) [195]
Copyright 2022 The Author(s)

Bla

Bla i hele MuninEnheter og samlingerForfatterlisteTittelDatoBla i denne samlingenForfatterlisteTittelDato
Logg inn

Statistikk

Antall visninger
UiT

Munin bygger på DSpace

UiT Norges Arktiske Universitet
Universitetsbiblioteket
uit.no/ub - munin@ub.uit.no

Tilgjengelighetserklæring