Evaluating the performance of various Heuristic Algorithms to Solve Flow Shop Scheduling Problem with Fuzzy Processing Time
Industrial and Manufacturing System Engineering Department, University of Benghazi, Faculty of Engineering, Benghazi, Libya.
Research Article
World Journal of Advanced Research and Reviews, 2024, 24(01), 1922–1928
Publication history:
Received on 19 August 2024 ; revised on 20 October 2024; accepted on 22 October 2024
Abstract:
This paper evaluates the performance of selected heuristic algorithms, namely Palmer’s and Campbell, Dudek and Smith (CDS) algorithm, Nawaz-Enscore-Ham (NEH), and SAI algorithms for minimizing the makespan in fuzzy flow shop scheduling problem (FSSP) with triangular fuzzy processing times. The algorithms are tested on sixteen benchmark problems with size up to 10 machines and 20 jobs using a MATLAB program. Computational results show that, despite its simplicity, the FNEH algorithm can provide the best results compared to other algorithms, regardless of the size of the problem.
Keywords:
Flow shop scheduling problem; Fuzzy processing time; Heuristic; Makespan.
Full text article in PDF:
Copyright information:
Copyright © 2024 Author(s) retain the copyright of this article. This article is published under the terms of the Creative Commons Attribution Liscense 4.0