Structured instances of restricted assignment with two processing times

DOI10.1007/978-3-319-53007-9_21MaRDI QIDQ2971651zbMATH OpenOpenAlexFDO

Authors 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

approximationrestricted assignmentscheduling

Mathematics Subject Classification ID

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

Recommendations

• On some special cases of the restricted assignment problem
• A quasi-polynomial approximation for the restricted assignment problem
• A quasi-polynomial approximation for the restricted assignment problem
• Estimating the makespan of the two-valued restricted assignment problem
• On (1,)-restricted assignment makespan minimization

Cites work

• A Combinatorial Approximation Algorithm for Graph Balancing with Light Hyper Edges
• Approximation algorithms for scheduling unrelated parallel machines
• Estimating the makespan of the two-valued restricted assignment problem
• scientific article; zbMATH DE number 5764783 (Why is no real title available?)
• On (1,)-restricted assignment makespan minimization
• On the configuration-LP of the restricted assignment problem

This page was built for publication: Structured instances of restricted assignment with two processing times

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