Experimental study of scheduling with memory constraints using hybrid methods

DOI10.1016/J.CAM.2009.07.004MaRDI QIDQ843175zbMATH OpenOpenAlexFDO

Authors M. Lawenda, Joanna Berlińska, M. Drozdowski

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

divisible loadsmemory limitationsmultiple installmentsparallel processingscheduling

Mathematics Subject Classification ID

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

Recommendations

• Heuristics for multi-round divisible loads scheduling with limited memory
• Optimum divisible load scheduling on heterogeneous stars with limited memory
• Divisible load scheduling in distributed system with buffer constraints: genetic algorithm and linear programming approach
• Parallel Processing and Applied Mathematics
• scientific article; zbMATH DE number 5842467

Cites work

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

Cited in

(11)

• FPT approximation algorithm for scheduling with memory constraints
• Optimizing memory allocation for multistage scheduling including setup times
• Optimum divisible load scheduling on heterogeneous stars with limited memory
• Communication scheduling in data gathering networks with limited memory
• A biased random-key genetic algorithm for single-round divisible load scheduling
• Scheduling multilayer divisible computations
• A divisible load scheduling model of maximizing service quality
• A biased random-key genetic algorithm for scheduling heterogeneous multi-round systems
• Parallel Processing and Applied Mathematics
• Polynomial time algorithms to find Pareto optimal schedules of bicriteria lot scheduling problems with splitable jobs on a single parallel-batch machine
• Heuristics for multi-round divisible loads scheduling with limited memory

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

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