POPULATION SIZE MODELING FOR GA IN TIME-CRITICAL TASK SCHEDULING

DOI10.1142/S0129054111008258zbMATH Open1211.68206MaRDI QIDQ2997923

Wei Sun

Publication date: 10 May 2011

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

zbMATH Keywords

modelinggenetic algorithmtask schedulingpopulation size

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• A genetic algorithm for the generalised assignment problem
• 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

Related Items (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)