Matching with sizes (or scheduling with processing set restrictions)

Matching problems on bipartite graphs where the entities on one side may have different sizes are intimately related to scheduling problems with processing set restrictions. We survey the close relationship between these two problems, and give new approximation algorithms for the (NP-hard) variations of the problems in which the sizes of the jobs are restricted. Specifically, we give an approximation algorithm with an additive error of one when the sizes of the jobs are either 1 or 2, and generalise this to an approximation algorithm with an additive error of 2 −1 for the case where each job has a size taken from the set {1, 2, 4, . . . , 2} (for any constant integer k). We show that the above two problems become polynomial time solvable if the processing sets are nested.

[1]  Jan Karel Lenstra,et al.  Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[2]  D. Manlove,et al.  Keeping partners together: algorithmic results for the hospitals/residents problem with couples , 2010, J. Comb. Optim..

[3]  Kurt Mehlhorn.  Assigning Papers to Referees , 2009, ICALP.

[4]  J. Gabszewicz,et al.  On Gale and Shapley "college admissions and the stability of marriage" , 2012 .

[5]  Eytan Ronn,et al.  NP-Complete Stable Matching Problems , 1990, J. Algorithms.

[6]  Kurt Mehlhorn,et al.  Rank-maximal matchings , 2004, TALG.

[7]  Paul A. Robards,et al.  Applying Two-Sided Matching Processes to the United States Navy Enlisted Assignment Process , 2001 .

[8]  László Lovász,et al.  Semi-matchings for bipartite graphs and load balancing , 2006, J. Algorithms.

[9]  A. Roth.  The Economist as Engineer: Game Theory, Experimentation, and Computation as Tools for Design Economics , 2002 .

[10]  Melissa M. Short.  Analysis of the Current Navy Enlisted Detailing Process , 2000 .

[11]  Frits C. R. Spieksma,et al.  A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths , 2001, Math. Oper. Res..

[12]  Katia Sycara,et al.  Two-Sided Matching for the U . S . Navy Detailing Process with Market Complication ∗ , 2003 .

[13]  Nodari Vakhania,et al.  An optimal rounding gives a better approximation for scheduling unrelated machines , 2005, Oper. Res. Lett..

[14]  C. Nash-Williams.  On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs , 1960, Canadian Journal of Mathematics.

[15]  Bettina Klaus,et al.  Some things couples always wanted to know about stable matchings (but were afraid to ask) , 2007 .

[16]  Dániel Marx,et al.  Stable assignment with couples: Parameterized complexity and local search , 2009, Discret. Optim..

[17]  Celia A. Glass,et al.  Parallel machine scheduling with job assignment restrictions , 2007 .

[18]  Celia A. Glass,et al.  Scheduling unit length jobs with parallel nested machine processing set restrictions , 2006, Comput. Oper. Res..

[19]  Chung-Lun Li,et al.  Scheduling with processing set restrictions: A survey , 2008 .

[20]  Noga Alon,et al.  Approximation schemes for scheduling , 1997, SODA '97.