On a Flow-Shop Scheduling Problem with Fuzzy Pentagonal Processing Time

Majed G. Alharbi, Hamiden Abd El-Wahed Khalifa and Basil Papadopoulos

Journal of Mathematics, 2021, vol. 2021, 1-7

Abstract: Scheduling involves planning and arranging jobs across a coordinated set of events to satisfy the customer’s demands. In this article, we present a simple approach for the flow-shop (FS) scheduling problem under fuzzy environment in which processing time of jobs are represented by pentagonal fuzzy numbers. This study is intended to reduce the rental cost of the machine in compliance with the rental policy. The fuzzy FS scheduling problem is solved without converting the processing time into its equivalent crisp numbers using a robust ranking technique and a fuzzy arithmetic pentagonal fuzzy numbers. A numerical illustration indicates that the approach is workable, accurate, and relevant.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2021/6695174.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2021/6695174.xml (application/xml)

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:hin:jjmath:6695174

DOI: 10.1155/2021/6695174

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().