Population size modeling for GA in time-critical task scheduling

DOI10.1142/S0129054111008258zbMATH Open1211.68206MaRDI QIDQ2997923FDOQ2997923

Authors: Wei Sun 

Publication date: 10 May 2011

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Recommendations

• Genetic algorithm based on critical path for task scheduling
• scientific article; zbMATH DE number 5284166
• Genetic algorithms used to solve scheduling problems
• scientific article; zbMATH DE number 953059
• Genetic algorithm approach for solving the task assignment problem

zbMATH Keywords

genetic algorithmmodelingpopulation sizetask scheduling

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Cites Work

• Title not available (Why is that?)
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems
• A genetic algorithm for the generalised assignment problem

Cited In (1)

• Population size matters: rigorous runtime results for maximizing the hypervolume indicator

This page was built for publication: Population size modeling for GA in time-critical task scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2997923)