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

Majed Alharbi | Zendy; Hamiden Abd El-Wahed Khalifa | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

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

Author(s) -

Majed Alharbi,

Hamiden Abd El-Wahed Khalifa

Publication year - 2021

Publication title -

journal of mathematics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.252

H-Index - 13

eISSN - 2314-4785

pISSN - 2314-4629

DOI - 10.1155/2021/6695174

Subject(s) - flow shop scheduling , fuzzy number , mathematics , fuzzy logic , scheduling (production processes) , mathematical optimization , renting , job shop scheduling , fuzzy set , computer science , schedule , artificial intelligence , engineering , operating system , civil engineering

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research