Approximating the non-contiguous multiple organization packing problem

DOI10.1007/978-3-642-15240-5_23MaRDI QIDQ3163893zbMATH OpenOpenAlexFDO

Authors Marin Bougeret, Pierre-Francois Dutot, Christina Otte, Klaus Jansen, Denis Trystram

Publication date 27 October 2010

Published in IFIP Advances in Information and Communication Technology (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Recommendations

• Improved approximation algorithms for scheduling parallel jobs on identical clusters
• Approximation algorithms for scheduling multiple two-stage flowshops
• Approximation algorithms for scheduling parallel jobs
• Approximation Algorithms for Scheduling Parallel Jobs: Breaking the Approximation Ratio of 2
• Scheduling parallel jobs on heterogeneous platforms

Cited in

(8)

• Coordination mechanisms for selfish parallel jobs scheduling (extended abstract)
• The price of multi-organization constraint in unrelated parallel machine scheduling
• Approximate truthful mechanism design for two-dimensional orthogonal knapsack problem
• Approximate composable truthful mechanism design
• Improved approximation algorithms for scheduling parallel jobs on identical clusters
• Peak demand minimization via sliced strip packing
• Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms
• Scheduling moldable tasks on homogeneous multi-cluster platforms with GPUs

This page was built for publication: Approximating the non-contiguous multiple organization packing problem

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