No-Wait Flowshop Permutation Scheduling Problem : Fire Hawk Optimizer Vs Beluga Whale Optimization Algorithm

No-Wait Flowshop Permutation Scheduling Problem (NWPFSP) is a scheduling problem that states every job completed on machine n must be processed immediately the next machine. The NWPFSP an extension of flowshop problem. This article proposes two new algorithms fire hawk optimization and beluga whale optimization, to solve minimize makespan. developed are tested three different cases. Each algorithm was run 30 times compared using independent sample t-test. results were also with Campbell Dudek Smtih algorithm. In addition, effectiveness FHO BWO assessed against CDS Relative Error Percentage (REP) method. show better at solving problems when However, more recommended in cases large data because it can provide results.