FPT approximation algorithm for scheduling with memory constraints

DOI10.1007/978-3-319-43659-3_15MaRDI QIDQ1693210zbMATH OpenOpenAlexFDO

Authors Eric Angel, Cédric Chevalier, F. Ledoux, Sébastien Morais, Damien Regnault

Publication date 11 January 2018

Full work available at URL https://doi.org/10.1007/978-3-319-43659-3_15

zbMATH Keywords

dynamic programmingapproximation algorithmschedulingfixed-parameter tractable

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Recommendations

• A Bi-Criteria FPTAS for Scheduling with Memory Constraints on Graphs with Bounded Tree-Width
• Preemptive Scheduling to Minimize Maximum Completion Time on Uniform Processors with Memory Constraints
• Approximability of scheduling with fixed jobs
• Experimental study of scheduling with memory constraints using hybrid methods
• On the optimality of approximation schemes for the classical scheduling problem

Cited in

(3)

• A Bi-Criteria FPTAS for Scheduling with Memory Constraints on Graphs with Bounded Tree-Width
• On approximating the memory-constrained module allocation problem
• Simultaneous Computational and Data Load Balancing in Distributed-Memory Setting

This page was built for publication: FPT approximation algorithm for scheduling with memory constraints

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