A Fuzzy Simheuristic for the Permutation Flow Shop Problem under Stochastic and Fuzzy Uncertainty

Juliana Castaneda, Xabier A. Martin, Majsa Ammouriova, Javier Panadero and Angel A. Juan
Additional contact information
Juliana Castaneda: Computer Science Department, Universitat Oberta de Catalunya, 08018 Barcelona, Spain
Xabier A. Martin: Computer Science Department, Universitat Oberta de Catalunya, 08018 Barcelona, Spain
Majsa Ammouriova: Computer Science Department, Universitat Oberta de Catalunya, 08018 Barcelona, Spain
Javier Panadero: Computer Science Department, Universitat Oberta de Catalunya, 08018 Barcelona, Spain
Angel A. Juan: Department of Applied Statistics and Operations Research, Universitat Politècnica de València, 03801 Alcoy, Spain

Mathematics, 2022, vol. 10, issue 10, 1-17

Abstract: Stochastic, as well as fuzzy uncertainty, can be found in most real-world systems. Considering both types of uncertainties simultaneously makes optimization problems incredibly challenging. In this paper, we analyze the permutation flow shop problem (PFSP) with both stochastic and fuzzy processing times. The main goal is to find the solution (permutation of jobs) that minimizes the expected makespan. However, due to the existence of uncertainty, other characteristics of the solution are also taken into account. In particular, we illustrate how survival analysis can be employed to enrich the probabilistic information given to decision-makers. To solve the aforementioned optimization problem, we extend the concept of a simheuristic framework so it can also include fuzzy elements. Hence, both stochastic and fuzzy uncertainty are simultaneously incorporated in the PFSP. In order to test our approach, classical PFSP instances have been adapted and extended, so that processing times become either stochastic or fuzzy. The experimental results show the effectiveness of the proposed approach when compared with more traditional ones.

Keywords: simulation-optimization; simheuristics; fuzzy techniques; stochastic optimization; permutation flow shop problem (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://www.mdpi.com/2227-7390/10/10/1760/pdf (application/pdf)
https://www.mdpi.com/2227-7390/10/10/1760/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:10:y:2022:i:10:p:1760-:d:820702

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().