Conventional and multirecombinative evolutionary algorithms for the parallel task scheduling problem

DOI10.1007/3-540-45365-2_23MaRDI QIDQ2770508zbMATH OpenFDO

Authors Susana C. Esquivel, Claudia Gatica, Raúl H. Gallard

Publication date 13 February 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2037/20370223

Mathematics Subject Classification ID

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)

Recommendations

• scientific article; zbMATH DE number 2079887
• scientific article; zbMATH DE number 1737496
• A modified hybrid genetic algorithm for parallel task scheduling of multiprocessors
• Evolutionary algorithms for jobshop scheduling
• Parallel multiobjective evolutionary algorithms for batch scheduling in heterogeneous computing and grid systems

Cited in

(7)

• Chaotic multiobjective evolutionary algorithm based on decomposition for test task scheduling problem
• Application of a hybrid evolutionary algorithm to resource-constrained parallel machine scheduling with setup times
• Hybrid evolutionary -- tabu search algorithm for scheduling multiple-variant tasks
• Evolution strategies on desktop grid environment using scheduling algorithms RR for same length tasks
• scientific article; zbMATH DE number 6612596 (Why is no real title available?)
• scientific article; zbMATH DE number 2079887 (Why is no real title available?)
• scientific article; zbMATH DE number 2158088 (Why is no real title available?)

This page was built for publication: Conventional and multirecombinative evolutionary algorithms for the parallel task scheduling problem

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