Solving the Scheduling Problem in the Electrical Panel Board Manufacturing Industry Using a Hybrid Atomic Orbital Search Optimization Algorithm


Marichelvam M. K., Ayyavoo G., Manimaran P., TOSUN Ö.

Processes, cilt.13, sa.9, 2025 (SCI-Expanded) identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 13 Sayı: 9
  • Basım Tarihi: 2025
  • Doi Numarası: 10.3390/pr13092930
  • Dergi Adı: Processes
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Aerospace Database, Communication Abstracts, INSPEC, Metadex, Directory of Open Access Journals, Civil Engineering Abstracts
  • Anahtar Kelimeler: atomic orbital search optimization algorithm, hybrid flow shop, makespan, scheduling
  • Akdeniz Üniversitesi Adresli: Evet

Özet

Efficient scheduling is critical for the success of any organization. Researchers have proposed numerous strategies for addressing various scheduling problems. The hybrid flow shop (HFS) scheduling is a complex and NP-hard problem that arises in many manufacturing and service industries. This work introduces an optimization technique that utilizes atomic orbitals to address issues in HFS scheduling. Our objective is to reduce makespan (Cmax). Makespan minimization is critical for improving productivity and resource utilization. The standard atomic orbital search optimization algorithm (AOSOA) is hybridized with constructive heuristics to enhance solution quality. The scheduling problem of an electrical panel board manufacturing industry is solved using the hybrid AOSOA (HAOSOA). The results were better than those previously reported. A variety of random test situations of varying sizes and configurations were devised to assess the efficacy of the suggested algorithm. The proposed algorithm’s outcomes were compared against well-known algorithms discussed in the literature. Friedman and Wilcoxon test results indicate that the proposed methodology improves the solution quality in each test instance compared to all the metaheuristics used for comparison. The performance of the proposed algorithm is also evaluated using benchmark problems from the literature. In the first test, the algorithm has a rank value of 1, indicating it performs better than each of the comparing algorithms. In the second test, it is able to find the best makespan for 65 of the 77 problems.