Lazy Local Search Meets Machine Scheduling

DOI10.1137/17M1139175zbMath1439.90030arXiv1611.07371OpenAlexW2981057370WikidataQ127022609 ScholiaQ127022609MaRDI QIDQ5237306

Chidambaram Annamalai

Publication date: 17 October 2019

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1611.07371

zbMATH Keywords

schedulinglocal searchunrelated parallel machinesconfiguration of linear programs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items (1)

A Quasi-Polynomial Approximation for the Restricted Assignment Problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation algorithms for scheduling unrelated parallel machines
• A quasi-polynomial approximation for the restricted assignment problem
• Quasi-polynomial Local Search for Restricted Max-Min Fair Allocation
• The Santa Claus problem
• The Design of Approximation Algorithms
• Santa claus meets hypergraph matchings
• On the Configuration-LP of the Restricted Assignment Problem
• Santa Claus Schedules Jobs on Unrelated Machines
• On (1,∊)-Restricted Assignment Makespan Minimization
• Combinatorial Algorithm for Restricted Max-Min Fair Allocation
• New Constructive Aspects of the Lovász Local Lemma

This page was built for publication: Lazy Local Search Meets Machine Scheduling