Solving Constrained Flow-Shop Scheduling Problem through Multistage Fuzzy Binding Approach with Fuzzy Due Dates

9Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper deals with constrained multistage machines flow-shop (FS) scheduling model in which processing times, job weights, and break-down machine time are characterized by fuzzy numbers that are piecewise as well as quadratic in nature. Avoiding to convert the model into its crisp, the closed interval approximation for the piecewise quadratic fuzzy numbers is incorporated. The suggested method leads a noncrossing optimal sequence to the considered problem and minimizes the total elapsed time under fuzziness. The proposed approach helps the decision maker to search for applicable solution related to real-world problems and minimizes the total fuzzy elapsed time. A numerical example is provided for the illustration of the suggested methodology.

Cite

CITATION STYLE

APA

Abd El-Wahed Khalifa, H., Alodhaibi, S. S., & Kumar, P. (2021). Solving Constrained Flow-Shop Scheduling Problem through Multistage Fuzzy Binding Approach with Fuzzy Due Dates. Advances in Fuzzy Systems, 2021. https://doi.org/10.1155/2021/6697060

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free