Fully polynomial time approximation schemes for scheduling divisible loads

DOI10.1007/978-3-642-14403-5_1zbMATH Open1304.90087OpenAlexW1528106255MaRDI QIDQ3583567FDOQ3583567

Authors: Joanna Berlińska 

Publication date: 17 August 2010

Published in: Parallel Processing and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14403-5_1

Recommendations

• Scheduling multiple divisible loads in homogeneous star systems
• Scheduling divisible loads with time and cost constraints
• Optimum divisible load scheduling on heterogeneous stars with limited memory
• scientific article; zbMATH DE number 5842467
• scientific article; zbMATH DE number 1222838

zbMATH Keywords

FPTASschedulingdivisible loads

Mathematics Subject Classification ID

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

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: Fully polynomial time approximation schemes for scheduling divisible loads

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