Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.13091/5221
Title: | An Efficient Parallel Greedy Algorithm for Fuzzy Hybrid Flow Shop Scheduling with Setup Time and Lot Size: A Case Study in Apparel Process | Authors: | Engin, O. İşler, M. |
Keywords: | Case study Fuzzy processing time and due date Hybrid flow shop Lot size Parallel greedy algorithm Setup time |
Publisher: | Research Expansion Alliance (REA) | Abstract: | This paper deals with the Fuzzy Hybrid Flow Shop (FHFS) scheduling inspired by a real apparel process. A Parallel Greedy (PG) algorithm is proposed to solve the FHFS problems with Setup Time (ST) and Lot Size (LS). The fuzzy model is used to define the uncertain setup and Processing Time (PT) and Due Dates (DDs). The setup and PTs are defined by a Triangular Fuzzy Number (TAFN). Also, the Fuzzy Due Date (FDD) is denoted by a doublet. The tardiness, the tardy jobs, the setup and Idle Time (IT), and the Total Flow (TF) time are minimized by the proposed PG algorithm. The effectiveness of the proposed PG algorithm is demonstrated by comparing it with the Genetic Algorithm (GeA) in the literature. A real-world application in an apparel process is done. According to the results, the proposed PG algorithm is an efficient method for FHFS scheduling problems with ST and LS in real-world applications. © 2022, Research Expansion Alliance (REA). All rights reserved. | URI: | https://doi.org/10.22105/jfea.2021.314312.1169 https://hdl.handle.net/20.500.13091/5221 |
ISSN: | 2783-1442 |
Appears in Collections: | Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collections |
Show full item record
CORE Recommender
SCOPUSTM
Citations
1
checked on Apr 27, 2024
Page view(s)
16
checked on Apr 29, 2024
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.