On some special cases of the restricted assignment problem

DOI10.1016/j.ipl.2016.06.007zbMath1362.90217OpenAlexW2472641902MaRDI QIDQ2630343

Chao Wang, R. A. Sitters

Publication date: 27 July 2016

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

Full work available at URL: https://ir.cwi.nl/pub/25091

zbMATH Keywords

schedulingdesign of algorithmsrestricted assignment problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (5)

Scheduling High Multiplicity Jobs on Parallel Multi-Purpose Machines with Setup Times and Machine Available Times ⋮ Approximation algorithms for the graph balancing problem with two speeds and two job lengths ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Greedy is optimal for online restricted assignment and smart grid scheduling for unit size jobs

Cites Work

• Fast approximation algorithms for job scheduling with processing set restrictions
• Approximation algorithms for scheduling unrelated parallel machines
• A note on graph balancing problems with restrictions
• An approximation algorithm for the generalized assignment problem
• The 2-valued case of makespan minimization with assignment constraints
• Parallel machine scheduling with nested job assignment restrictions
• Graph balancing: a special case of scheduling unrelated parallel machines
• On the Configuration-LP for Scheduling on Unrelated Machines
• Santa Claus Schedules Jobs on Unrelated Machines
• Parallel machine scheduling with job assignment restrictions

This page was built for publication: On some special cases of the restricted assignment problem