Multiprocessor scheduling by generalized extremal optimization
From MaRDI portal
Publication:600839
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1236283 (Why is no real title available?)
- scientific article; zbMATH DE number 1059167 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- Efficient batch job scheduling in grids using cellular memetic algorithms
- Handbook of global optimization. Vol. 2
- Optimization by simulated annealing
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)