Multiprocessor scheduling in a genetic paradigm

DOI10.1016/0167-8191(95)00068-2zbMath0875.68709OpenAlexW2015261337WikidataQ127526465 ScholiaQ127526465MaRDI QIDQ1351360

Imtiaz Ahmad, Muhammad K. Dhodhi

Publication date: 27 February 1997

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(95)00068-2

zbMATH Keywords

Genetic algorithmGraph theoryMultiprocessor systemScheduling problem

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (5)

JOB SEQUENCING IN AN EVOLUTIONARY PARADIGM ⋮ DRSCRO: A metaheuristic algorithm for task scheduling on heterogeneous systems ⋮ PERMUTATION-BASED GENETIC, TABU, AND VARIABLE NEIGHBORHOOD SEARCH HEURISTICS FOR MULTIPROCESSOR SCHEDULING WITH COMMUNICATION DELAYS ⋮ A proposed solution for the load balancing problem on heterogeneous clusters based on a delayed neural network ⋮ A bipartite genetic algorithm for multi-processor task scheduling

This page was built for publication: Multiprocessor scheduling in a genetic paradigm