Matching with sizes (or scheduling with processing set restrictions)

DOI10.1016/j.endm.2010.05.043zbMath1237.90083MaRDI QIDQ5891543

Péter Biró, Eric J. McDermid

Publication date: 13 May 2012

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: http://real.mtak.hu/13519/7/BiroM10tr.pdf

zbMATH Keywords

scheduling; matching; approximation algorithms; couples; processing set restrictions

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C27: Combinatorial optimization

Related Items

Matching with sizes (or scheduling with processing set restrictions), Matching with sizes (or scheduling with processing set restrictions), Stable assignment with couples: parameterized complexity and local search

Cites Work

• Unnamed Item
• Approximation algorithms for scheduling unrelated parallel machines
• Parallel machine scheduling with nested job assignment restrictions
• An optimal rounding gives a better approximation for scheduling unrelated machines
• Scheduling unit length jobs with parallel nested machine processing set restrictions
• Parallel machine scheduling with nested processing set restrictions
• A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths
• On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
• Stable Assignment with Couples: Parameterized Complexity and Local Search
• Parallel machine scheduling with job assignment restrictions
• Semi-matchings for bipartite graphs and load balancing
• Matching with sizes (or scheduling with processing set restrictions)