Multiprocessor scheduling by generalized extremal optimization
DOI10.1007/S10951-009-0141-9zbMATH Open1208.68101OpenAlexW1995437859MaRDI QIDQ600839FDOQ600839
Authors: Piotr Switalski, Franciszek Seredynski
Publication date: 3 November 2010
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-009-0141-9
Recommendations
GAparticle swarm optimizationgenetic algorithmPSOBak-Sneppen modelGEOgeneralized extremal optimizationmultiprocessor scheduling problem
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Problems related to evolution (92D15) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
Cited In (8)
- Greedy multiprocessor server scheduling
- Search techniques for a nonlinear multiprocessor scheduling problem
- An effective multiprocessor scheduling with use of GEO metaheuristic
- General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time
- A two-stage hardware scheduler combining greedy and optimal scheduling
- Tighter Bounds for the Multifit Processor Scheduling Algorithm
- Performance guarantees of local search for multiprocessor scheduling
- Explicit Modelling of Multiple Intervals in a Constraint Generation Procedure for Multiprocessor Scheduling
This page was built for publication: Multiprocessor scheduling by generalized extremal optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q600839)