A. Dogan and F. Ozguner, Genetic Algorithm Based Scheduling of Meta-Tasks with Stochastic Execution Times in Heterogeneous Computing Systemst1, Cluster Computing, vol.7, issue.2, pp.177-190, 2004.
DOI : 10.1023/B:CLUS.0000018566.13071.cb

H. Izakian and A. Abraham, Metaheuristic based scheduling metatasks in distributed heterogeneous computing systems, Sensors, vol.97, pp.5339-5350, 2009.
DOI : 10.3390/s90705339

URL : http://doi.org/10.3390/s90705339

E. Hart, P. Ross, and D. Corne, Evolutionary Scheduling: A Review, Genetic Programming and Evolvable Machines, vol.47, issue.1, pp.191-220, 2005.
DOI : 10.1007/s10710-005-7580-7

R. W. Conway, W. L. Maxwell, . Miller, and W. Louis, Theory of scheduling, 2012.

G. Falzon and M. Li, Enhancing list scheduling heuristics for dependent job scheduling in grid computing environments, The Journal of Supercomputing, vol.8, issue.2, pp.104-130, 2012.
DOI : 10.1007/s11227-010-0422-2

I. Wang, Y. -lin, C. Wang, and . Chen, Scheduling unrelated parallel machines in semiconductor manufacturing by problem reduction and local search heuristics, Flexible Services and Manufacturing Journal, vol.38, issue.3, pp.343-366, 2013.
DOI : 10.1007/s10696-012-9150-7

C. Hsu, D. Tc-edwin-cheng, and . Yang, Unrelated parallelmachine scheduling with rate-modifying activities to minimize the total completion time, Information Sciences, vol.18120, pp.4799-4803, 2011.

Y. Unlu and S. J. Mason, Evaluation of mixed integer programming formulations for non-preemptive parallel machine scheduling problems, Computers & Industrial Engineering, vol.58, issue.4, pp.785-800, 2010.
DOI : 10.1016/j.cie.2010.02.012

. Chyu, W. Chiuh-cheng, and . Chang, A Pareto evolutionary algorithm approach to bi-objective unrelated parallel machine scheduling problems, The International Journal of Advanced Manufacturing Technology, vol.12, issue.3, pp.5-8, 2010.
DOI : 10.1007/s00170-009-2419-7

J. M. Van-den-akker, C. P. Van-hoesel, and M. Savelsbergh, A polyhedral approach to single-machine scheduling problems, Mathematical Programming, vol.85, issue.3, pp.541-572, 1999.
DOI : 10.1007/s10107990047a

I. Kacem, Approximation algorithm for the weighted ow-time minimization on a single machine with a xed non-availability interval, Computers & Industrial Engineering, vol.543, pp.401-410, 2008.

J. R. Hardin, L. George, . Nemhauser, W. Martin, and . Savelsbergh, Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements, Discrete Optimization, vol.5, issue.1, pp.19-35, 2008.
DOI : 10.1016/j.disopt.2007.10.003

M. Pinedo, Planning and scheduling in manufacturing and services, 2005.
DOI : 10.1007/978-1-4419-0910-7

S. A. Cook, The complexity of theorem-proving procedures, Proceedings of the third annual ACM symposium on Theory of computing , STOC '71, pp.151-158, 1971.
DOI : 10.1145/800157.805047

V. Vignesh, S. Kumar, K. Jaisankar, and N. , Resource Management and Scheduling in Cloud Environment, International Journal of Scientic and Research Publications, vol.3, issue.6, 2013.

V. Vinothina, . Sr, . R. Dr, . Sridaran, . Dr et al., A Survey on Resource Allocation Strategies in Cloud Computing, International Journal of Advanced Computer Science and Applications, vol.3, issue.6, pp.97-104

A. Schrijver, Combinatorial Optimization : Polyhedra and Eciency, Algorithms and Combinatorics, vol.24, 2003.

A. R. Mahjoub, Polyhedral Approaches, pp.261-324, 2013.
DOI : 10.1002/9781118600245.ch10

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

Z. Michalewicz and D. B. Fogel, How to Solve It : Modern Heuristics, 2000.
DOI : 10.1007/978-3-662-04131-4

L. Francisco, A. Enrique, and A. J. Nebro, Parallel Meta-heuristic : A New Class of Algorithms, 2005.

D. Henderson, S. H. Jacobson, and A. W. Johnson, Metaheuristic Handbook The Theory and Practice of Simulated Annealing, 2003.

K. Genova and V. Guliashki, Linear integer programming methods and approaches :a survey, Journal of Cybernetics and Information Technologies, vol.11, issue.1, 2011.

L. G. Khachiyan, Polynomial algorithms in linear programming, USSR Computational Mathematics and Mathematical Physics, vol.20, issue.1, pp.1093-1096, 1979.
DOI : 10.1016/0041-5553(80)90061-0

H. W. Lenstra and J. , Integer Programming with a Fixed Number of Variables, Mathematics of Operations Research, vol.8, issue.4, pp.538-548, 1983.
DOI : 10.1287/moor.8.4.538

J. Tsai, Optimized task scheduling and resource allocation on cloud computing environment using improved differential evolution algorithm, Computers & Operations Research, vol.40, issue.12, pp.3045-3033, 2013.
DOI : 10.1016/j.cor.2013.06.012

A. M. Hariri and C. N. Potts, Heuristics for scheduling unrelated parallel machines, Computers & Operations Research, vol.18, issue.3, pp.323-331, 1991.
DOI : 10.1016/0305-0548(91)90034-O

C. A. Glass, C. N. Potts, and P. Shade, Unrelated parallel machine scheduling using local search, Mathematical and Computer Modelling, vol.20, issue.2, pp.41-52, 1994.
DOI : 10.1016/0895-7177(94)90205-4

URL : http://doi.org/10.1016/0895-7177(94)90205-4

J. Ge, Y. Wei, and . Yuan, Research of Cloud Computing Task Scheduling Algorithm Based on Improved Genetic Algorithm, Applied Mechanics and Materials, vol.347, issue.350, 2013.
DOI : 10.4028/www.scientific.net/AMM.347-350.2426

S. Jang and . Ho, The study of genetic algorithm-based task scheduling for cloud computing, International Journal of Control and Automation, vol.54, pp.157-162, 2012.

S. Dao and R. Marian, Optimisation of precedence-constrained production sequencing and scheduling using genetic algorithms, Diss. Newswood Limited, 2011.

G. Falzon and M. Li, Enhancing genetic algorithms for dependent job scheduling in grid computing environments, The Journal of Supercomputing, vol.51, issue.1, pp.290-314, 2012.
DOI : 10.1007/s11227-011-0721-2

J. Li, M. Qiu, Z. Ming, G. Quan, X. Qin et al., Online optimization for scheduling preemptable tasks on IaaS cloud systems, Journal of Parallel and Distributed Computing, vol.72, issue.5, pp.666-677, 2012.
DOI : 10.1016/j.jpdc.2012.02.002

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

M. Pfund, J. W. Fowler, N. Jatinder, and . Gupta, A SURVEY OF ALGORITHMS FOR SINGLE AND MULTI-OBJECTIVE UNRELATED PARALLEL-MACHINE DETERMINISTIC SCHEDULING PROBLEMS, Journal of the Chinese Institute of Industrial Engineers, vol.34, issue.3, pp.230-241, 2004.
DOI : 10.1016/0098-1354(94)00100-3

E. Vallada and R. Ruiz, A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times, European Journal of Operational Research, vol.211, issue.3, pp.612-622, 2011.
DOI : 10.1016/j.ejor.2011.01.011

L. Fanjul-peyro and R. Ruiz, Iterated greedy local search methods for unrelated parallel machine scheduling, European Journal of Operational Research, vol.207, issue.1, pp.55-69, 2010.
DOI : 10.1016/j.ejor.2010.03.030

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

S. Ghanbari and M. Othman, Volume Removed - Publisher's Disclaimer, Procedia Engineering, vol.50, pp.778-785, 2012.
DOI : 10.1016/S1877-7058(14)00002-2

X. Wu, M. Deng, R. Zhang, B. Zeng, and S. Zhou, A Task Scheduling Algorithm based on QoS-Driven in Cloud Computing, Procedia Computer Science, vol.17, pp.1162-1169, 2013.
DOI : 10.1016/j.procs.2013.05.148

X. Wang, C. Shin-yeo, R. Buyya, and J. Su, Optimizing the makespan and reliability for workflow applications with reputation and a look-ahead genetic algorithm, Future Generation Computer Systems, vol.27, issue.8, pp.1124-1134, 2011.
DOI : 10.1016/j.future.2011.03.008

S. Jing, State-of-the-art research study for green cloud computing, The Journal of Supercomputing, vol.15, issue.5, pp.445-468, 2013.
DOI : 10.1007/s11227-011-0722-1

J. Herrmann, J. Proth, and N. Sauer, Heuristics for unrelated machine scheduling with precedence constraints, European Journal of Operational Research, vol.102, issue.3, pp.528-537, 1997.
DOI : 10.1016/S0377-2217(96)00247-0

L. Min and W. Cheng, A genetic algorithm for minimizing the makespan in the case of scheduling identical parallel machines, Artificial Intelligence in Engineering, vol.13, issue.4, pp.399-403, 1999.
DOI : 10.1016/S0954-1810(99)00021-7

A. M. Rahmani and M. Rezvani, A Novel Genetic Algorithm for Static Task Scheduling in Distributed Systems, International Journal of Computer Theory and Engineering, vol.1, issue.1, pp.1793-8201, 2009.
DOI : 10.7763/IJCTE.2009.V1.1

B. , Y. Kacem, I. Laroche, P. Nagih, and A. , Exact and Heuristic Methods for Minimizing the Total Completion Time in Job-shops, Studies in Informatics and Control, pp.31-40, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01267624

K. , Y. K. Ahmad, and I. , Static Scheduling Algorithms for Allocating Directed Task Graphs to Multiprocessors, ACM Computing Surveys, vol.31, issue.4, pp.406-471, 1999.

Z. , G. Xu, Y. Tian, S. Zhao, and H. , A Genetic-based Task scheduling Algorithms on Heterogeneous Computing Systems to Minimize Makespan, Journal of Convergence Information Technology( JCIT), vol.8, issue.5, pp.547-555, 2013.

Z. Wu, A revised discrete particle swarm optimization for cloud workow scheduling, 2010 International Conference on, 2010.
DOI : 10.1109/cis.2010.46

K. , Y. Lu, H. He, and J. , A PSO-based Genetic Algorithm for Scheduling of Tasks in a Heterogeneous Distributed System, Journal of software, vol.8, issue.6, pp.1443-1450, 2013.

T. , R. Taheri, F. Bazzazi, M. Izadi, M. Sassani et al., Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints, Computers & Operations Research, vol.36, issue.12, pp.3224-3230, 2009.

M. L. Pinedo, Scheduling : theory, algorithms, and systems, 2012.

R. Mcnaughton, Scheduling with Deadlines and Loss Functions, Management Science, vol.6, issue.1, pp.1-12, 1959.
DOI : 10.1287/mnsc.6.1.1

J. Blazewicz, M. Dror, and J. Weglarz, Mathematical programming formulations for machine scheduling: A survey, European Journal of Operational Research, vol.51, issue.3, pp.283-300, 1991.
DOI : 10.1016/0377-2217(91)90304-E

. Gacias, C. Bernat, P. Artigues, and . Lopez, Parallel machine scheduling with precedence constraints and setup times, Computers & Operations Research, vol.37, issue.12, pp.2141-2151, 2010.
DOI : 10.1016/j.cor.2010.03.003

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

. Ying, Z. Kuo-ching, S. Lee, and . Lin, Makespan minimization for scheduling unrelated parallel machines with setup times, Journal of Intelligent Manufacturing, vol.14, issue.5, pp.1795-1803, 2012.
DOI : 10.1007/s10845-010-0483-3

C. Liaw, Scheduling unrelated parallel machines to minimize total weighted tardiness, Computers & Operations Research, vol.30, issue.12, pp.1777-1789, 2003.
DOI : 10.1016/S0305-0548(02)00105-3

R. Garey and D. Johnson, Computers and Intractability : A Guide to the Theory of NP-Completeness, Series of Books in the Mathematical Sciences, W. H. Freeman, 1979.

I. Aho and E. Makinen, On a parallel machine scheduling problem with precedence constraints, Journal of Scheduling, vol.6, issue.5, pp.493-495, 2006.
DOI : 10.1007/s10951-006-8499-4

M. Ghirardi and C. N. Potts, Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach, European Journal of Operational Research, vol.165, issue.2, pp.457-467, 2005.
DOI : 10.1016/j.ejor.2004.04.015

URL : http://porto.polito.it/1400713/1/MakespanMin.pdf

I. Wang, Y. -lin, C. Wang, and . Chen, Scheduling unrelated parallel machines in semiconductor manufacturing by problem reduction and local search heuristics, Flexible Services and Manufacturing Journal, vol.38, issue.3, pp.343-366, 2013.
DOI : 10.1007/s10696-012-9150-7

S. Balin, Non-identical parallel machine scheduling using genetic algorithm, Expert Systems with Applications, vol.38, issue.6, pp.6814-6821, 2011.
DOI : 10.1016/j.eswa.2010.12.064

R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. Rinnooykan, Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey, Annals of Discrete Mathematics, vol.5, p.287326, 1979.
DOI : 10.1016/S0167-5060(08)70356-X

J. Paulo-de, C. M. Nogueira, J. Elias, C. Arroyo, H. Mauricio et al., Hybrid GRASP Heuristics to Solve an Unrelated Parallel Machine Scheduling Problem with Earliness and Tardiness Penalties, Electronic Notes in Theoretical Computer Science, vol.302, pp.53-72, 2012.

A. Mingozzi, V. Maniezzo, S. Ricciardelli, and L. Bianco, An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation, Management Science, vol.44, issue.5, pp.714-729, 1998.
DOI : 10.1287/mnsc.44.5.714

H. Mohammed-albarra, I. Kacem, S. Martin, and I. M. Osman, Genetic Algorithm for Job Scheduling in Cloud Computing, Studies in Informatics and Control, vol.24, issue.3, pp.387-399, 2015.

K. Li, Scheduling Precedence Constrained Parallel Tasks on Multiprocessors Using the Harmonic System Partitioning Scheme, Journal of Information Science and Engineering, vol.21, pp.309-326, 2012.

C. Liu and S. Yang, A Heuristic Serial Schedule Algorithm for Unrelated Parallel Machine Scheduling With Precedence Constraints, Journal of Software, vol.6, issue.6, pp.1146-1153, 2011.
DOI : 10.4304/jsw.6.6.1146-1153

URL : https://doaj.org/article/321e1626382d44e8bdbc5eb483e1f734

J. Blazewicz, M. Dror, and J. Weglarz, Mathematical programming formulations for machine scheduling: A survey, European Journal of Operational Research, vol.51, issue.3, pp.283-300, 1991.
DOI : 10.1016/0377-2217(91)90304-E

A. R. Kan, Machine scheduling problemsThe Hauge, Martinus Nijho, 1976.

V. Kumar and . Anil, Scheduling on unrelated machines under tree-like precedence constraints Approximation, Randomization and Combinatorial Optimization . Algorithms and Techniques, pp.146-157, 2005.
DOI : 10.1007/11538462_13

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

E. B. Edis, C. Oguz, and I. Ozkarahan, Parallel machine scheduling with additional resources: Notation, classification, models and solution methods, European Journal of Operational Research, vol.230, issue.3, pp.449-463, 2013.
DOI : 10.1016/j.ejor.2013.02.042

P. E. Coll, C. C. Ribeiro, and C. C. De-souza, Multiprocessor scheduling under precedence constraints: Polyhedral results, Discrete Applied Mathematics, vol.154, issue.5, p.770801, 2006.
DOI : 10.1016/j.dam.2004.07.009

URL : http://doi.org/10.1016/j.dam.2004.07.009

I. Kacem, Lower Bounds for Tardiness Minimization on a Single Machine with Family Setup Times, The Proceedings of the Multiconference on "Computational Engineering in Systems Applications", pp.18-31, 2007.
DOI : 10.1109/CESA.2006.4281799

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

G. Nicholas, M. E. Hall, and . Posner, Generating Experimental Data for Computational Testing with Machine Scheduling Applications, Operations Research, vol.49, issue.7, pp.854-865, 2011.

A. Agnetis, H. Kellerer, G. Nicosia, and A. Pacici, Parallel dedicated machines scheduling with chain precedence constraints, European Journal of Operational Research, vol.221, issue.2, p.296305, 2012.
DOI : 10.1016/j.ejor.2012.03.040

C. Lekkeikerker and J. Boland, Representation of a nite graph by a set of intervals on the real line, Fundamenta Mathematicae, vol.51, issue.1, pp.45-64, 1962.

K. Aardal and C. P. Van-hoesel, Polyhedral techniques in combinatorial optimization II: applications and computations, Statistica Neerlandica, vol.53, issue.2, p.131177, 1999.
DOI : 10.1111/1467-9574.00104

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

M. Hassan, I. Kacem, S. Martin, and I. M. Osman, Mathematical Formulations for the Unrelated Parallel Machines with Precedence Constraints, International Conference on Computers & Industrial Engineering, 2015.
DOI : 10.1109/codit.2016.7593644

S. Martello, F. Soumis, and P. Toth, Exact and approximation algorithms for makespan minimization on unrelated parallel machines, Discrete Applied Mathematics, vol.75, issue.2, p.169188, 1997.
DOI : 10.1016/S0166-218X(96)00087-X

URL : http://doi.org/10.1016/s0166-218x(96)00087-x

M. Jiinger, G. Reinelt, and S. Thienel, Practical problem solving with cutting plane algorithms in combinatorial optimization, Combinatorial Optimization, Dimacs, vol.20, p.111152, 1995.
DOI : 10.1090/dimacs/020/02

P. Damodaran, H. V. Sharma, and R. Moraga, Scheduling Unrelated Parallel Machines with Sequence Dependent Setup Times to Minimize Makespan, IIE Annual Conference. Proceedings (p. 1). Institute of Industrial Engineers- Publisher, 2012.

R. Mcnaughton, Scheduling with Deadlines and Loss Functions, Management Science, vol.6, issue.1, p.112, 1959.
DOI : 10.1287/mnsc.6.1.1

M. Pinedo, Scheduling theory, algorithm, and systems, 1995.

L. Eduardo, S. , and V. , Modelling the Parallel Machine Scheduling Problem with Step Deteriorating Jobs, European Journal of Operational Research, 2016.

L. Bianco and M. Caramia, A new formulation for the project scheduling problem under limited resources, Flexible Services and Manufacturing Journal, vol.4, issue.5, p.624, 2013.
DOI : 10.1007/s10696-011-9127-y

A. Naber and R. Kolisch, MIP models for resource-constrained project scheduling with flexible resource profiles, European Journal of Operational Research, vol.239, issue.2, pp.335-383, 2014.
DOI : 10.1016/j.ejor.2014.05.036

URL : http://mediatum.ub.tum.de/doc/1229681/document.pdf

W. Herroelen, D. Reyck, B. Demeulemeester, and E. , Resource-constrained project scheduling : a survey of recent developments. Computers & Operations Research, pp.279-302, 1998.

E. Kim, Scheduling of uniform parallel machines with s-precedence constraints. Mathematical and Computer Modelling, pp.576-83, 2011.
DOI : 10.1016/j.mcm.2011.03.001

URL : http://doi.org/10.1016/j.mcm.2011.03.001

E. Kim, C. Sung, and I. Lee, Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints. Computers & Operations Research, pp.698-710, 2009.

G. Ramachandra and S. Elmaghraby, Sequencing precedence-related jobs on two machines to minimize the weighted completion time, International Journal of Production Economics, vol.100, issue.1, pp.44-58, 2006.
DOI : 10.1016/j.ijpe.2004.10.014

E. Cadi, A. Souissi, O. Atitallah, R. Belanger, N. Artiba et al., Mathematical programming models for scheduling in a CPU/FPGA architecture with heterogeneous communication delays, Journal of Intelligent Manufacturing, vol.7, pp.1-2, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01247399

E. Vallada and R. Ruiz, Scheduling unrelated parallel machines with sequence dependent setup times and weighted earliness tardiness minimization. InJust-in- Time Systems, pp.67-90, 2012.
DOI : 10.1007/978-1-4614-1123-9_4

M. Golumbic and . Charles, Algorithmic graph theory and perfect graphs, 2004.

F. Hao, D. Park, and G. Min, Young-Sik Jeong, and Jong-Hyuk Park. k-Cliques Mining in Dynamic Social Networks based on Triadic Formal Concept Analysis, Neurocomputing, 2016.

E. Mokoto and P. Chretienne, A cutting plane algorithm for the unrelated parallel machine scheduling problem, European Journal of Operational Research, vol.141, issue.3, pp.515-525, 2002.
DOI : 10.1016/S0377-2217(01)00270-3

M. Habib, R. Mcconnell, C. Paul, and L. Viennot, Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing, Theoretical Computer Science, vol.234, issue.1-2, pp.59-84, 2000.
DOI : 10.1016/S0304-3975(97)00241-7

URL : http://doi.org/10.1016/s0304-3975(97)00241-7

P. M. Pardalos and J. Xue, The maximum clique problem, Journal of Global Optimization, vol.46, issue.1, pp.301-328, 1994.
DOI : 10.1007/BF01098364

Y. Ma and D. Jin, Concurrent Open-shop Scheduling Model Research, 2013.
DOI : 10.14257/ijunesst.2013.6.5.01

D. Bai and L. Tang, Open shop scheduling problem to minimize makespan with release dates, Applied Mathematical Modelling, vol.37, issue.4, pp.2008-2015, 2013.
DOI : 10.1016/j.apm.2012.04.037

URL : http://dx.doi.org/10.1016/j.apm.2012.04.037

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 : http://doi.org/10.1016/s0166-218x(97)00018-8

B. Naderi, S. F. Ghomi, M. Aminnayeri, and M. Zandieh, Scheduling open shops with parallel machines to minimize total completion time, Journal of Computational and Applied Mathematics, vol.235, issue.5, pp.1275-1287, 2011.
DOI : 10.1016/j.cam.2010.08.013

G. Sakellari and G. Loukas, A survey of mathematical models, simulation approaches and testbeds used for research in cloud computing, Simulation Modelling Practice and Theory, vol.39, pp.92-103, 2013.
DOI : 10.1016/j.simpat.2013.04.002

T. Masuda and H. Ishii, Two machine open shop scheduling problem with bi-criteria, Discrete Applied Mathematics, vol.52, issue.3, pp.253-259, 1994.
DOI : 10.1016/0166-218X(94)90144-9

URL : http://doi.org/10.1016/0166-218x(94)90144-9

T. Kis, D. D. Werra, and W. Kubiak, A projective algorithm for preemptive open shop scheduling with two multiprocessor groups, Operations Research Letters, vol.38, issue.2, pp.129-132, 2010.
DOI : 10.1016/j.orl.2009.10.007

E. Taillard, Benchmarks for basic scheduling problems, European Journal of Operational Research, vol.64, issue.2, pp.278-285, 1993.
DOI : 10.1016/0377-2217(93)90182-M

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

A. Bekrar, An improved heuristic and an exact algorithm for the 2D strip and bin packing problem, International Journal of Product Development, vol.10, issue.1/2/3, pp.1-3, 2009.
DOI : 10.1504/IJPD.2010.029994

J. Bå, K. H. Ecker, E. Pesch, G. Schmidt, and J. Weglarz, Scheduling computer and manufacturing processes, 2013.

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

URL : https://doaj.org/article/f15ad89777c54e95a9c3ca043a572be6

M. Pinedo, Planning and scheduling in manufacturing and services, 2005.
DOI : 10.1007/978-1-4419-0910-7