2-approximation algorithm for a generalization of scheduling on unrelated parallel machines

DOI10.1016/j.ipl.2018.07.005zbMath1481.90166OpenAlexW2883241831MaRDI QIDQ1799571

Jaya Prakash Champati, Yossi Azar, Ben Liang

Publication date: 19 October 2018

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2018.07.005

zbMATH Keywords

schedulingmakespanapproximation algorithmsunrelated machinesopen cycles

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Approximation algorithms for scheduling unrelated parallel machines
• Analysis of a linear programming heuristic for scheduling unrelated parallel machines
• Algorithms for Scheduling Tasks on Unrelated Processors
• Exact and Approximate Algorithms for Scheduling Nonidentical Processors
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• All-norm approximation algorithms
• Algorithm Theory - SWAT 2004

This page was built for publication: 2-approximation algorithm for a generalization of scheduling on unrelated parallel machines