An Improved Marriage in Honey-Bee Optimization Algorithm for Minimizing Earliness/Tardiness Penalties in Single-Machine Scheduling with a Restrictive Common Due Date
This study evaluates the efficiency of a swarm intelligence algorithm called marriage in honey-bee optimization (MBO) in solving the single-machine weighted earliness/tardiness problem, a type of NP-hard combinatorial optimization problem. The goal is to find the optimal sequence for completing a se...
Autors principals: | , , , |
---|---|
Format: | Article |
Idioma: | English |
Publicat: |
MDPI AG
2025-01-01
|
Col·lecció: | Mathematics |
Matèries: | |
Accés en línia: | https://www.mdpi.com/2227-7390/13/3/418 |