An efficient parallel greedy algorithm for fuzzy hybrid flow shop scheduling with setup time and lot size: a case study in apparel process

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 Du...

Full description

Saved in:
Bibliographic Details
Published in:Journal of fuzzy extension & applications (Online) 2022-07, Vol.3 (3), p.249-262
Main Authors: Orhan Engin, Meral İşler
Format: Article
Language:English
Subjects:
case study
fuzzy processing time and due date
hybrid flow shop
lot size
parallel greedy algorithm
setup time
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2783-1442
2717-3453
DOI:10.22105/jfea.2021.314312.1169