Multiprocessor Fair Scheduling Based on an Improved Slime Mold Algorithm
An improved slime mold algorithm (IMSMA) is presented in this paper for a multiprocessor multitask fair scheduling problem, which aims to reduce the average processing time. An initial population strategy based on Bernoulli mapping reverse learning is proposed for the slime mold algorithm. A Cauchy...
Main Authors: | Manli Dai, Zhongyi Jiang |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2023-10-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | https://www.mdpi.com/1999-4893/16/10/473 |
Similar Items
-
Mutational Slime Mould Algorithm for Gene Selection
by: Feng Qiu, et al.
Published: (2022-08-01) -
An Improved Solution to Generation Scheduling Problem Using Slime Mold Algorithm
by: Zixuan Zhu
Published: (2022-05-01) -
Hybrid Slime Mold and Arithmetic Optimization Algorithm with Random Center Learning and Restart Mutation
by: Hongmin Chen, et al.
Published: (2023-08-01) -
Implementation of Chaotic Reverse Slime Mould Algorithm Based on the Dandelion Optimizer
by: Yi Zhang, et al.
Published: (2023-10-01) -
Fine-Tuning of Pre-Trained Deep Face Sketch Models Using Smart Switching Slime Mold Algorithm
by: Khaled Mohammad Alhashash, et al.
Published: (2023-04-01)