R. H. Ahmadi and U. Bagchi, Scheduling of multi-job customer orders in multi-machine environments, 1990.

A. Allahverdi, C. T. Ng, T. C. Cheng, and M. Y. Kovalyov, A survey of scheduling problems with setup times or costs, European Journal of Operational Research, vol.187, issue.3, pp.985-1032, 2008.
DOI : 10.1016/j.ejor.2006.06.060

A. Aubry, A. Rossi, M. Espinouse, and M. Jacomino, Minimizing setup costs for parallel multi-purpose machines under load-balancing constraint, European Journal of Operational Research, vol.187, issue.3, pp.1115-1125, 2008.
DOI : 10.1016/j.ejor.2006.05.050

A. Benoit, J. Langguth, and B. Uçar, Semi-Matching Algorithms for Scheduling Parallel Tasks under Resource Constraints, 2013 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum, 2013.
DOI : 10.1109/IPDPSW.2013.30

URL : https://hal.archives-ouvertes.fr/hal-00738393

L. Bianco, P. Dell-'olmo, and M. G. Speranza, Scheduling independent tasks with multiple modes, Discrete Applied Mathematics, vol.62, issue.1-3, pp.1-3, 1995.
DOI : 10.1016/0166-218X(95)00003-A

M. Caramia and S. Giordani, A new approach for scheduling independent tasks with multiple modes, Journal of Heuristics, vol.136, issue.4, pp.313-329, 2009.
DOI : 10.1007/s10732-007-9062-y

B. V. Cherkassky, A. V. Goldberg, P. Martin, J. C. Setubal, and J. Stolfi, Augment or push, Journal of Experimental Algorithmics, vol.3, p.8, 1998.
DOI : 10.1145/297096.297140

M. Drozdowski, Scheduling multiprocessor tasks ??? An overview, European Journal of Operational Research, vol.94, issue.2, pp.215-230, 1996.
DOI : 10.1016/0377-2217(96)00123-3

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.159.1883

I. S. Duff, K. Kaya, and B. Uçar, Design, implementation, and analysis of maximum transversal algorithms, ACM Transactions on Mathematical Software, vol.38, issue.2, pp.1-1331, 2011.
DOI : 10.1145/2049673.2049677

URL : https://hal.archives-ouvertes.fr/hal-00786548

J. Fakcharoenphol, B. Laekhanukit, and D. Nanongkai, Faster Algorithms for Semi-Matching Problems, ACM Transactions on Algorithms, vol.10, issue.3, 2010.
DOI : 10.1145/2601071

M. R. Garey and D. S. Johnson, Computers and Intractability; A Guide to the Theory of NP-Completeness

A. V. Goldberg and R. E. Tarjan, A new approach to the maximum-flow problem, Journal of the ACM, vol.35, issue.4, pp.921-940, 1988.
DOI : 10.1145/48014.61051

R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. Kan, Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey, Discrete Optimization II Proceedings of the Advanced Research Institute on Discrete Optimization and Systems Applications of the Systems Science Panel of NATO and of the Discrete Optimization Symposium, ser. Annals of Discrete Mathematics, P. L. Hammer, E. L
DOI : 10.1016/S0167-5060(08)70356-X

N. J. Harvey, R. E. Ladner, L. Lovász, and T. Tamir, Semi-matchings for bipartite graphs and load balancing, Journal of Algorithms, vol.59, issue.1, pp.53-78, 2006.
DOI : 10.1016/j.jalgor.2005.01.003

K. Kaya, J. Langguth, F. Manne, and B. Uçar, Push-relabel based algorithms for the maximum transversal problem, Computers & Operations Research, vol.40, issue.5, 2013.
DOI : 10.1016/j.cor.2012.12.009

URL : https://hal.archives-ouvertes.fr/hal-00763920

J. Langguth, F. Manne, and P. Sanders, Heuristic initialization for bipartite matching problems, Journal of Experimental Algorithmics, vol.15, pp.1-1, 2010.
DOI : 10.1145/1671970.1712656

K. Lee, J. Y. Leung, and M. L. Pinedo, A note on ???An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs???, Information Processing Letters, vol.109, issue.12, pp.608-610, 2009.
DOI : 10.1016/j.ipl.2009.02.010

J. Y. Leung and C. Li, Scheduling with processing set restrictions: A survey, International Journal of Production Economics, vol.116, issue.2, pp.251-262, 2008.
DOI : 10.1016/j.ijpe.2008.09.003

J. Y. Leung, H. Li, and M. Pinedo, Scheduling orders for multiple product types to minimize total weighted completion time, Discrete Applied Mathematics, vol.155, issue.8, pp.945-970, 2007.
DOI : 10.1016/j.dam.2006.09.012

J. Y. Leung, H. Li, M. Pinedo, and C. Sriskandarajah, Open shops with jobs overlap??????revisited, European Journal of Operational Research, vol.163, issue.2, pp.569-571, 2005.
DOI : 10.1016/j.ejor.2003.11.023

C. Li, Scheduling unit-length jobs with machine eligibility restrictions, European Journal of Operational Research, vol.174, issue.2, pp.1325-1328, 2006.
DOI : 10.1016/j.ejor.2005.03.023

Y. Lin and W. Li, Parallel machine scheduling of machine-dependent jobs with unit-length, European Journal of Operational Research, vol.156, issue.1, pp.261-266, 2004.
DOI : 10.1016/S0377-2217(02)00914-1

C. P. Low, An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs, Information Processing Letters, vol.100, issue.4, pp.154-161, 2006.
DOI : 10.1016/j.ipl.2006.06.004

T. Roemer, A note on the complexity of the concurrent open shop problem, Journal of Scheduling, vol.8, issue.2, pp.389-396, 2006.
DOI : 10.1007/s10951-006-7042-y

E. Saule and D. V. Bozda?-g, Optimizing the stretch of independent tasks on a cluster: From sequential tasks to moldable tasks, Journal of Parallel and Distributed Computing, vol.72, issue.4, pp.489-503, 2012.
DOI : 10.1016/j.jpdc.2011.12.007

E. V. Shchepin and N. Vakhania, Task distributions on multiprocessor systems Exploring New Frontiers of Theoretical Informatics, ser. TCS '00, Proceedings of the International Conference IFIP on Theoretical Computer Science, pp.112-125, 2000.

E. Wagneur and C. Sriskandarajah, Openshops with jobs overlap, European Journal of Operational Research, vol.71, issue.3, pp.366-378, 1993.
DOI : 10.1016/0377-2217(93)90347-P