Abstract
The flow-shop scheduling problem (FSSP) has received a considerable amount of attention due to its wide-ranging applications. However, the omission of uncertainty significantly diminishes the practicality of scheduling results, underscoring its the necessity to address uncertainty in the flow shop problem. In this paper, a fuzzy two-machine flow-shop problem is considered and an effective algorithm with a fuzzy ranking method is proposed to minimize the total waiting time. The processing times are represented using trapezoidal membership functions. Furthermore, a two-stage flow shop scheduling problem is used in the proposed algorithm and various categories of fuzzy mean techniques. The experimental results and statistical comparisons demonstrate that the proposed algorithm exhibits significant advantages in effectively solving the FFSSP (Fuzzy Flow-Shop Scheduling Problem).
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 callDisclaimer: 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.
