Experimental study of scheduling with memory constraints using hybrid methods

DOI10.1016/J.CAM.2009.07.004zbMath1170.90006OpenAlexW1963615676MaRDI QIDQ843175

M. Lawenda, Maciej Drozdowski, Joanna Berlińska

Publication date: 29 September 2009

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2009.07.004

zbMATH Keywords

schedulingparallel processingdivisible loadsmemory limitationsmultiple installments

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)

Related Items (4)

Communication scheduling in data gathering networks with limited memory ⋮ Heuristics for multi-round divisible loads scheduling with limited memory ⋮ A biased random-key genetic algorithm for single-round divisible load scheduling ⋮ Scheduling Multilayer Divisible Computations

Cites Work

• Optimum divisible load scheduling on heterogeneous stars with limited memory
• Parallel Processing and Applied Mathematics

This page was built for publication: Experimental study of scheduling with memory constraints using hybrid methods