J. Achugbue and F. Chin, Scheduling the Open Shop to Minimize Mean Flow Time, SIAM Journal on Computing, vol.11, issue.4, pp.709-720, 1982.
DOI : 10.1137/0211058

E. Anand and R. Panneerselvam, Literature Review of Open Shop Scheduling Problems, Intelligent Information Management, vol.07, issue.01, pp.33-52, 2015.
DOI : 10.4236/iim.2015.71004

M. S. Bazarra and J. J. Goode, The traveling salesman problem: A duality approach, Mathematical Programming, vol.1, issue.1, pp.221-237, 1977.
DOI : 10.1007/BF01584338

C. Blum, Beam-ACO???hybridizing ant colony optimization with beam search: an application to open shop scheduling, Computers & Operations Research, vol.32, issue.6, pp.1565-1591, 2005.
DOI : 10.1016/j.cor.2003.11.018

P. Brucker, J. Hurink, B. Jurish, and B. Wostmann, A branch & bound algorithm for the open-shop problem, Discrete Applied Mathematics, vol.76, issue.1-3, pp.43-59, 1997.
DOI : 10.1016/S0166-218X(96)00116-3

G. C. Ciro, F. Dugardin, F. Yalaoui, and R. Kelly, A fuzzy ant colony optimization to solve an open shop scheduling problem with multiskills resource constraints, INCOM, vol.48, pp.715-720, 2015.

G. C. Ciro, F. Dugardin, F. Yalaoui, and R. Kelly, Open shop scheduling problem with a multi-skills resource constraint: a genetic algorithm and an ant colony optimisation approach, International Journal of Production Research, pp.1-28, 2015.

M. Dorigo, V. Maniezzo, and A. Colorni, Positive feedback as a search strategy, 1991.

M. Dorigo, V. Maniezzo, and A. Colorni, Ant system: optimization by a colony of cooperating agents, IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics), vol.26, issue.1, pp.29-41, 1996.
DOI : 10.1109/3477.484436

M. L. Fisher, Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I, Operations Research, vol.21, issue.5, pp.1114-1127, 1973.
DOI : 10.1287/opre.21.5.1114

A. M. Geoffrion, Lagrangean relaxation for integer programming, Mathematical Programming Study, vol.2, pp.82-114, 1974.
DOI : 10.1007/BFb0120690

T. Gonzalez and S. Sahni, Open Shop Scheduling to Minimize Finish Time, Journal of the ACM, vol.23, issue.4, pp.665-679, 1976.
DOI : 10.1145/321978.321985
URL : http://www.cs.ucsb.edu/~teo/papers/OSJACM.pdf

S. Goss, S. Aron, J. Deneubourg, and J. Pasteels, Self-organized shortcuts in the Argentine ant, Naturwissenschaften, vol.2, issue.12, pp.579-581, 1989.
DOI : 10.1007/BF00462870

M. Held and R. M. Karp, The traveling-salesman problem and minimum spanning trees: Part II, Mathematical Programming, vol.6, issue.1, pp.6-25, 1971.
DOI : 10.1007/BF01584070

S. Hossein and H. Doulabi, A mixed integer linear formulation for the open shop earlinesstardiness scheduling problem, Applied Mathematical Sciences, vol.4, pp.1703-1710, 2010.

Y. Huang and J. Lin, A new bee colony optimization algorithm with idle-time-based filtering scheme for open shop-scheduling problems, Expert Systems with Applications, vol.38, issue.5, pp.5438-5447, 2011.
DOI : 10.1016/j.eswa.2010.10.010

S. Johnson, Optimal two- and three-stage production schedules with setup times included, Naval Research Logistics Quarterly, vol.1, issue.1, pp.61-68, 1954.
DOI : 10.1002/nav.3800010110

G. J. Kyparisis and C. Koulamas, Open shop scheduling with maximal machines, Discrete Applied Mathematics, vol.78, issue.1-3, pp.175-187, 1997.
DOI : 10.1016/S0166-218X(97)00018-8
URL : https://doi.org/10.1016/s0166-218x(97)00018-8

C. F. Liaw, A tabu search algorithm for the open shop scheduling problem, Computers & Operations Research, vol.26, issue.2, pp.109-126, 1999.
DOI : 10.1016/S0305-0548(98)00056-2

C. F. Liaw, A hybrid genetic algorithm for the open shop scheduling problem, European Journal of Operational Research, vol.124, issue.1, pp.28-42, 2000.
DOI : 10.1016/S0377-2217(99)00168-X

B. Naderi, S. Ghomi-fatemi, M. Aminnayeri, and M. Zandieh, A study on open shop scheduling to minimise total tardiness, International Journal of Production Research, vol.40, issue.15, pp.4657-4678, 2011.
DOI : 10.1002/nav.3800060205

C. Ng, T. Cheng, and J. Yuan, Concurrent open shop scheduling to minimize the weighted number of tardy jobs, Journal of Scheduling, vol.6, issue.4, pp.405-412, 2003.
DOI : 10.1023/A:1024284828374

C. Prins, Competitive genetic algorithms for the open-shop scheduling problem, Mathematical Methods of Operations Research (ZOR), vol.52, issue.3, pp.389-411, 2000.
DOI : 10.1007/s001860000090

V. Roshanaei, M. Esfehani, and M. Zandieh, Integrating non-preemptive open shops scheduling with sequence-dependent setup times using advanced metaheuristics, Expert Systems with Applications, vol.37, issue.1, pp.259-266, 2010.
DOI : 10.1016/j.eswa.2009.05.003

G. T. Ross and R. M. Soland, A branch and bound algorithm for the generalized assignment problem, Mathematical Programming, vol.21, issue.1, pp.91-103, 1975.
DOI : 10.1007/BF01580430

G. I. Zobolas, C. D. Tarantilis, and G. Ioannou, Exact, Heuristic and Meta-heuristic Algorithms for Solving Shop Scheduling Problems, Metaheuristics for Scheduling in Industrial and Manufacturing Applications, pp.1-40, 2008.
DOI : 10.1007/978-3-540-78985-7_1