Structured Instances of Restricted Assignment with Two Processing Times

DOI10.1007/978-3-319-53007-9_21zbMath1485.68024OpenAlexW2585421835MaRDI QIDQ2971651

Lars Rohwedder, Klaus Jansen

Publication date: 7 April 2017

Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-53007-9_21

zbMATH Keywords

schedulingapproximationrestricted assignment

Mathematics Subject Classification ID

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
• On the Configuration-LP of the Restricted Assignment Problem
• A Combinatorial Approximation Algorithm for Graph Balancing with Light Hyper Edges
• Santa Claus Schedules Jobs on Unrelated Machines
• On (1,∊)-Restricted Assignment Makespan Minimization
• Estimating The Makespan of The Two-Valued Restricted Assignment Problem

This page was built for publication: Structured Instances of Restricted Assignment with Two Processing Times