Vector assignment schemes for asymmetric settings

DOI10.1007/s00236-005-0003-7zbMath1089.68025OpenAlexW2001260910MaRDI QIDQ2491210

Leah Epstein, Tamir Tassa

Publication date: 26 May 2006

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-005-0003-7

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) Approximation algorithms (68W25)

Related Items (4)

Approximation schemes for the generalized extensible bin packing problem ⋮ Approximation and online algorithms for multidimensional bin packing: a survey ⋮ Vector scheduling with rejection on a single machine ⋮ Approximating vector scheduling: almost matching upper and lower bounds

Cites Work

• A 13/12 approximation algorithm for bin packing with extendable bins
• Approximation schemes for scheduling on parallel machines
• A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
• Vector assignment problems: a general framework
• Bounds for Certain Multiprocessing Anomalies
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Vector assignment schemes for asymmetric settings