Abstract

AbstractThis research considers the fuzzy hybrid flow shop (FHFS) problem inspired by a real application in an apparel manufacturing process. A parallel greedy algorithm (PGA) is proposed for solving the FHFS scheduling problem with lot sizes. The uncertain setup, and processing time (PT), and due date (DD) is modeled by the fuzzy sets. The setup and PT are defined by a triangular fuzzy number (TFN) and DD by doublet fuzzy number (DFN). The objectives are minimizing the average tardiness, and the number of tardy jobs, the total setup time, and idle time of machines, and the total flow time. The proposed parallel greedy algorithm is compared with the genetic algorithm in the literature. The developed PGA is tested on real-world data collected at an apparel manufacturing process. Computational results are showed that the proposed parallel greedy algorithm is a more effective meta-heuristic method for FHFS problems with setup times and lot sizes. KeywordsFuzzy hybrid flow shopParallel greedy algorithmApparel manufacturingLot sizes

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.