Accès ouvert · CC BY

A Νew Heuristic Optimization Approach to the Single Hoist Cyclic Scheduling Problem

Article scientifique 2024 Sciences de l'ingénieur et technologies Anglais

Résumé

This paper introduces an innovative heuristic optimization approach, referred to as Optimization Approach-Single Hoist Cyclic Scheduling Problem (OA-SHCSP), which aims to minimize the cycle time of the Single Hoist Scheduling Problem (SHCSP). The effectiveness of this proposed heuristic is compared with a previously established heuristic, the Earliest Starting Time (EST). The comparison results reveal that the proposed OA-SHCSP heuristic consistently outperforms the EST heuristic in minimizing cycle time, particularly when more than two products are produced simultaneously. Moreover, as the number of part tasks soaked during a cycle increases, OA-SHCSP demonstrates significantly improved computational efficiency over the EST heuristic. The reduction in average cycle time achieved by OA-SHCSP ranges from 28.73% to 60.29%, underscoring its effectiveness and potential for application in high-volume production environments.

Citer ce document

Amraoui, A. E., & Benrejeb, M. (2024). A Νew Heuristic Optimization Approach to the Single Hoist Cyclic Scheduling Problem. Engineering Technology & Applied Science Research. https://doi.org/10.48084/etasr.8767

Exporter : BibTeX · RIS (Zotero, Mendeley, EndNote)

Accès au document

Texte intégral archivé sur SPHAERO, en accès ouvert : lisible gratuitement en ligne après connexion. Le document reste aussi disponible à sa source. Se connecter

Voir l'article sur le site de la revue

Licence et provenance

Licence : CC BY

Notice moissonnée depuis OpenAlex le 28/09/2026. Le document reste hébergé par sa source.
Voir le document à la source →

Statistiques

Consultations (hors robots) : 8

Téléchargements (hors robots) : 0

Méthode de comptage