Addressing the permutational flow shop scheduling problem through constructive heuristics: A statistical comparison
Flow shop problem has been addressed by many researchers around the world. Different heuristic methods has been developed to deal with this kind of problems. Nevertheless, it is necessary to explore the impact that the bottleneck machine has on the performance of each heuristic. In this article an F...
- Autores:
-
Velásquez Rodríguez, Javier
Neira Rodado, Dionicio
Parody, Alexander
Crespo, Fernando
BRUGES BALLESTEROS, LAURINA SOFIA
- Tipo de recurso:
- Article of journal
- Fecha de publicación:
- 2021
- Institución:
- Corporación Universidad de la Costa
- Repositorio:
- REDICUC - Repositorio CUC
- Idioma:
- eng
- OAI Identifier:
- oai:repositorio.cuc.edu.co:11323/8842
- Acceso en línea:
- https://hdl.handle.net/11323/8842
https://repositorio.cuc.edu.co/
- Palabra clave:
- Flow shop
Heuristics
Makespan
- Rights
- embargoedAccess
- License
- CC0 1.0 Universal
| id |
RCUC2_561c67e1cfba40d1bff3d96f6e9ac24e |
|---|---|
| oai_identifier_str |
oai:repositorio.cuc.edu.co:11323/8842 |
| network_acronym_str |
RCUC2 |
| network_name_str |
REDICUC - Repositorio CUC |
| repository_id_str |
|
| dc.title.spa.fl_str_mv |
Addressing the permutational flow shop scheduling problem through constructive heuristics: A statistical comparison |
| title |
Addressing the permutational flow shop scheduling problem through constructive heuristics: A statistical comparison |
| spellingShingle |
Addressing the permutational flow shop scheduling problem through constructive heuristics: A statistical comparison Flow shop Heuristics Makespan |
| title_short |
Addressing the permutational flow shop scheduling problem through constructive heuristics: A statistical comparison |
| title_full |
Addressing the permutational flow shop scheduling problem through constructive heuristics: A statistical comparison |
| title_fullStr |
Addressing the permutational flow shop scheduling problem through constructive heuristics: A statistical comparison |
| title_full_unstemmed |
Addressing the permutational flow shop scheduling problem through constructive heuristics: A statistical comparison |
| title_sort |
Addressing the permutational flow shop scheduling problem through constructive heuristics: A statistical comparison |
| dc.creator.fl_str_mv |
Velásquez Rodríguez, Javier Neira Rodado, Dionicio Parody, Alexander Crespo, Fernando BRUGES BALLESTEROS, LAURINA SOFIA |
| dc.contributor.author.spa.fl_str_mv |
Velásquez Rodríguez, Javier Neira Rodado, Dionicio Parody, Alexander Crespo, Fernando BRUGES BALLESTEROS, LAURINA SOFIA |
| dc.subject.spa.fl_str_mv |
Flow shop Heuristics Makespan |
| topic |
Flow shop Heuristics Makespan |
| description |
Flow shop problem has been addressed by many researchers around the world. Different heuristic methods has been developed to deal with this kind of problems. Nevertheless, it is necessary to explore the impact that the bottleneck machine has on the performance of each heuristic. In this article an F6 || Cmax (Makespan) flow shop is tackled with different well-known heuristics in open literature, such as Palmer, Johnson, Gupta, CDS, NEH and PAS and their impact on Cmax was measure. The methodology used seeks to find the possible relationship between the different bottleneck machines and the result obtained from each of the heuristics. For this experiment, there were 302 scenarios with six machines in series, in which each machine had a parity number of scenarios in which it was the bottleneck. The values of Cmax obtained for each heuristic were compared against the result of corresponding MILP (Mixed Integer Liner Problem) problem. The results show that the performance of the NEH heuristic is superior in each scenario, regardless of the bottleneck, but also shows a variable behavior in each heuristic, taking into account the bottleneck machine. |
| publishDate |
2021 |
| dc.date.accessioned.none.fl_str_mv |
2021-11-08T13:10:00Z |
| dc.date.available.none.fl_str_mv |
2021-11-08T13:10:00Z |
| dc.date.issued.none.fl_str_mv |
2021-09-17 |
| dc.date.embargoEnd.none.fl_str_mv |
2022-09-17 |
| dc.type.spa.fl_str_mv |
Artículo de revista |
| dc.type.coar.fl_str_mv |
http://purl.org/coar/resource_type/c_2df8fbb1 |
| dc.type.coar.spa.fl_str_mv |
http://purl.org/coar/resource_type/c_6501 |
| dc.type.content.spa.fl_str_mv |
Text |
| dc.type.driver.spa.fl_str_mv |
info:eu-repo/semantics/article |
| dc.type.redcol.spa.fl_str_mv |
http://purl.org/redcol/resource_type/ART |
| dc.type.version.spa.fl_str_mv |
info:eu-repo/semantics/acceptedVersion |
| format |
http://purl.org/coar/resource_type/c_6501 |
| status_str |
acceptedVersion |
| dc.identifier.issn.spa.fl_str_mv |
03029743 |
| dc.identifier.uri.spa.fl_str_mv |
https://hdl.handle.net/11323/8842 |
| dc.identifier.doi.spa.fl_str_mv |
10.1007/978-3-030-84340-3_13 |
| dc.identifier.instname.spa.fl_str_mv |
Corporación Universidad de la Costa |
| dc.identifier.reponame.spa.fl_str_mv |
REDICUC - Repositorio CUC |
| dc.identifier.repourl.spa.fl_str_mv |
https://repositorio.cuc.edu.co/ |
| identifier_str_mv |
03029743 10.1007/978-3-030-84340-3_13 Corporación Universidad de la Costa REDICUC - Repositorio CUC |
| url |
https://hdl.handle.net/11323/8842 https://repositorio.cuc.edu.co/ |
| dc.language.iso.none.fl_str_mv |
eng |
| language |
eng |
| dc.relation.references.spa.fl_str_mv |
Neira Rodado, D., Escobar, J.W., García-Cáceres, R.G., Niebles Atencio, F.A.: A mathematical model for the product mixing and lot-sizing problem by considering stochastic demand. Int. J. Ind. Eng. Comput. 8(2), 237–250 (2016) Salcedo Miranda, R., Crespo, F., Ramirez, D., Neira, D., Castro Bolaño, L.J., Puello, N.: Estrategias de cooperación como fuente de competitividad: Caso de estudio del clúster de muebles del departamento del Atlántico (Colombia) (2017) Ortiz, M., Neira, D., Jiménez, G., Hernández, H.: Solving flexible job-shop scheduling problem with transfer batches, setup times and multiple resources in apparel industry. In: Tan, Y., Shi, Y., Li, L. (eds.) ICSI 2016. LNCS, vol. 9713, pp. 47–58. Springer, Cham (2016). https://ezproxy.cuc.edu.co:2067/10.1007/978-3-319-41009-8_6 Rossit, D.A., Tohmé, F., Frutos, M.: The non-permutation flow-shop scheduling problem: a literature review. Omega 77, 143–153 (2017) Wilson, J.M.: Alternative formulations of a flow-shop scheduling problem. J. Oper. Res. Soc. 40(4), 395–399 (1989) Neufeld, J.S., Gupta, J.N.D., Buscher, U.: A comprehensive review of flowshop group scheduling literature (2016) Ronconi, D.P., Birgin, E.G.: Mixed-integer programming models for flowshop scheduling problems minimizing the total earliness and tardiness. In: Ríos-Mercado, R., Ríos-Solís, Y. (eds.) Just-in-Time Systems. SOIA, vol. 60, pp. 91–105. Springer, New York (2012). Reza Hejazi, S., Saghafian, S.: Flowshop-scheduling problems with makespan criterion: a review. Int. J. Prod. Res. 43(14), 2895–2929 (2005) Phanden, R.K., Jain, A.: Assessment of makespan performance for flexible process plans in job shop scheduling. IFAC-PapersOnLine 48(3), 1948–1953 (2015) Semančo, P., Modrák, V.: A comparison of constructive heuristics with the objective of minimizing makespan in the flow-shop scheduling problem. Acta Polytech. Hungarica 9(5), 2012–177 (2012) Palmer, D.S.: Sequencing jobs through a multi-stage process in the minimum total time—a quick method of obtaining a near optimum. J. Oper. Res. Soc. 16(1), 101–107 (1965) Gupta, J.N.D.: A heuristic algorithm for the flowshop scheduling problem. Rev. Fr. d’Automatique Inform. Rech. Oper. 10(2), 63–73 (1976) Gupta, J.N.D.: A Functional heuristic algorithm for the flowshop scheduling problem. J. Oper. Res. Soc. 22(1), 39–47 (1971) Nawaz, M., Enscore, E.E., Ham, I.: A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11(1), 91–95 (1983) Campbell, H.G., Dudek, R.A., Smith, M.L.: A HEURISTIC ALGORITHM FOR THE n JOB, m MACHINE SEQUENCING PROBLEM* f, no. 10 (1970) Alharkan, I.M.: Algorithms for Sequencing and Scheduling Pugazhenthi, R., Anthony Xavior, M., Somasundharam, E.: Minimizing makespan of a permutation flowshop by, pp. 110–112 (2014) Nurprihatin, F., Jayadi, E.L., Tannady, H.: Comparing heuristic methods’ performance for pure flow shop scheduling under certain and uncertain demand. Manag. Prod. Eng. Rev. 11, 50–61 (2020) |
| dc.rights.spa.fl_str_mv |
CC0 1.0 Universal |
| dc.rights.uri.spa.fl_str_mv |
http://creativecommons.org/publicdomain/zero/1.0/ |
| dc.rights.accessrights.spa.fl_str_mv |
info:eu-repo/semantics/embargoedAccess |
| dc.rights.coar.spa.fl_str_mv |
http://purl.org/coar/access_right/c_f1cf |
| rights_invalid_str_mv |
CC0 1.0 Universal http://creativecommons.org/publicdomain/zero/1.0/ http://purl.org/coar/access_right/c_f1cf |
| eu_rights_str_mv |
embargoedAccess |
| dc.format.mimetype.spa.fl_str_mv |
application/pdf |
| dc.publisher.spa.fl_str_mv |
Springer International Publishing |
| dc.source.spa.fl_str_mv |
Lecture Notes in Computer Science |
| institution |
Corporación Universidad de la Costa |
| dc.source.url.spa.fl_str_mv |
https://www.springerprofessional.de/en/addressing-the-permutational-flow-shop-scheduling-problem-throug/19674548 |
| bitstream.url.fl_str_mv |
https://repositorio.cuc.edu.co/bitstreams/3058b08c-38f1-4139-9516-1344c9f660bd/download https://repositorio.cuc.edu.co/bitstreams/7bec2189-fad2-4ff2-97af-6c4c761c4174/download https://repositorio.cuc.edu.co/bitstreams/400d921a-2ba8-4c0a-a772-2c2f05978238/download https://repositorio.cuc.edu.co/bitstreams/f62bdf91-e0d4-4dbd-a304-3270245fb7f2/download https://repositorio.cuc.edu.co/bitstreams/63f6645a-4dee-429f-aab1-b838fa799d03/download |
| bitstream.checksum.fl_str_mv |
c8faab62f54aab4e1c2367e1c6b24af0 42fd4ad1e89814f5e4a476b409eb708c e30e9215131d99561d40d6b0abbe9bad a31dae850185e8a753193e19cb0c420d daf86c4611523418e6b39106e1086e7c |
| bitstream.checksumAlgorithm.fl_str_mv |
MD5 MD5 MD5 MD5 MD5 |
| repository.name.fl_str_mv |
Repositorio de la Universidad de la Costa CUC |
| repository.mail.fl_str_mv |
repdigital@cuc.edu.co |
| _version_ |
1811760735054725120 |
| spelling |
Velásquez Rodríguez, JavierNeira Rodado, DionicioParody, AlexanderCrespo, FernandoBRUGES BALLESTEROS, LAURINA SOFIA2021-11-08T13:10:00Z2021-11-08T13:10:00Z2021-09-172022-09-1703029743https://hdl.handle.net/11323/884210.1007/978-3-030-84340-3_13Corporación Universidad de la CostaREDICUC - Repositorio CUChttps://repositorio.cuc.edu.co/Flow shop problem has been addressed by many researchers around the world. Different heuristic methods has been developed to deal with this kind of problems. Nevertheless, it is necessary to explore the impact that the bottleneck machine has on the performance of each heuristic. In this article an F6 || Cmax (Makespan) flow shop is tackled with different well-known heuristics in open literature, such as Palmer, Johnson, Gupta, CDS, NEH and PAS and their impact on Cmax was measure. The methodology used seeks to find the possible relationship between the different bottleneck machines and the result obtained from each of the heuristics. For this experiment, there were 302 scenarios with six machines in series, in which each machine had a parity number of scenarios in which it was the bottleneck. The values of Cmax obtained for each heuristic were compared against the result of corresponding MILP (Mixed Integer Liner Problem) problem. The results show that the performance of the NEH heuristic is superior in each scenario, regardless of the bottleneck, but also shows a variable behavior in each heuristic, taking into account the bottleneck machine.Velásquez Rodríguez, Javier-will be generated-orcid-0000-0002-8257-6016-600Neira Rodado, Dionicio-will be generated-orcid-0000-0003-0837-7083-600Parody, Alexander-will be generated-orcid-0000-0001-8765-6237-600Crespo, Fernando-will be generated-orcid-0000-0001-9918-4492-600BRUGES BALLESTEROS, LAURINA SOFIA-will be generated-orcid-0000-0002-6847-1111-600application/pdfengSpringer International PublishingCC0 1.0 Universalhttp://creativecommons.org/publicdomain/zero/1.0/info:eu-repo/semantics/embargoedAccesshttp://purl.org/coar/access_right/c_f1cfLecture Notes in Computer Sciencehttps://www.springerprofessional.de/en/addressing-the-permutational-flow-shop-scheduling-problem-throug/19674548Flow shopHeuristicsMakespanAddressing the permutational flow shop scheduling problem through constructive heuristics: A statistical comparisonArtículo de revistahttp://purl.org/coar/resource_type/c_6501http://purl.org/coar/resource_type/c_2df8fbb1Textinfo:eu-repo/semantics/articlehttp://purl.org/redcol/resource_type/ARTinfo:eu-repo/semantics/acceptedVersionNeira Rodado, D., Escobar, J.W., García-Cáceres, R.G., Niebles Atencio, F.A.: A mathematical model for the product mixing and lot-sizing problem by considering stochastic demand. Int. J. Ind. Eng. Comput. 8(2), 237–250 (2016)Salcedo Miranda, R., Crespo, F., Ramirez, D., Neira, D., Castro Bolaño, L.J., Puello, N.: Estrategias de cooperación como fuente de competitividad: Caso de estudio del clúster de muebles del departamento del Atlántico (Colombia) (2017)Ortiz, M., Neira, D., Jiménez, G., Hernández, H.: Solving flexible job-shop scheduling problem with transfer batches, setup times and multiple resources in apparel industry. In: Tan, Y., Shi, Y., Li, L. (eds.) ICSI 2016. LNCS, vol. 9713, pp. 47–58. Springer, Cham (2016). https://ezproxy.cuc.edu.co:2067/10.1007/978-3-319-41009-8_6Rossit, D.A., Tohmé, F., Frutos, M.: The non-permutation flow-shop scheduling problem: a literature review. Omega 77, 143–153 (2017)Wilson, J.M.: Alternative formulations of a flow-shop scheduling problem. J. Oper. Res. Soc. 40(4), 395–399 (1989)Neufeld, J.S., Gupta, J.N.D., Buscher, U.: A comprehensive review of flowshop group scheduling literature (2016)Ronconi, D.P., Birgin, E.G.: Mixed-integer programming models for flowshop scheduling problems minimizing the total earliness and tardiness. In: Ríos-Mercado, R., Ríos-Solís, Y. (eds.) Just-in-Time Systems. SOIA, vol. 60, pp. 91–105. Springer, New York (2012).Reza Hejazi, S., Saghafian, S.: Flowshop-scheduling problems with makespan criterion: a review. Int. J. Prod. Res. 43(14), 2895–2929 (2005)Phanden, R.K., Jain, A.: Assessment of makespan performance for flexible process plans in job shop scheduling. IFAC-PapersOnLine 48(3), 1948–1953 (2015)Semančo, P., Modrák, V.: A comparison of constructive heuristics with the objective of minimizing makespan in the flow-shop scheduling problem. Acta Polytech. Hungarica 9(5), 2012–177 (2012)Palmer, D.S.: Sequencing jobs through a multi-stage process in the minimum total time—a quick method of obtaining a near optimum. J. Oper. Res. Soc. 16(1), 101–107 (1965)Gupta, J.N.D.: A heuristic algorithm for the flowshop scheduling problem. Rev. Fr. d’Automatique Inform. Rech. Oper. 10(2), 63–73 (1976)Gupta, J.N.D.: A Functional heuristic algorithm for the flowshop scheduling problem. J. Oper. Res. Soc. 22(1), 39–47 (1971)Nawaz, M., Enscore, E.E., Ham, I.: A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11(1), 91–95 (1983)Campbell, H.G., Dudek, R.A., Smith, M.L.: A HEURISTIC ALGORITHM FOR THE n JOB, m MACHINE SEQUENCING PROBLEM* f, no. 10 (1970)Alharkan, I.M.: Algorithms for Sequencing and SchedulingPugazhenthi, R., Anthony Xavior, M., Somasundharam, E.: Minimizing makespan of a permutation flowshop by, pp. 110–112 (2014)Nurprihatin, F., Jayadi, E.L., Tannady, H.: Comparing heuristic methods’ performance for pure flow shop scheduling under certain and uncertain demand. Manag. Prod. Eng. Rev. 11, 50–61 (2020)PublicationORIGINALAddressing the Permutational Flow Shop Scheduling Problem Through Constructive Heuristics A Statistical Comparison.pdfAddressing the Permutational Flow Shop Scheduling Problem Through Constructive Heuristics A Statistical Comparison.pdfapplication/pdf9061https://repositorio.cuc.edu.co/bitstreams/3058b08c-38f1-4139-9516-1344c9f660bd/downloadc8faab62f54aab4e1c2367e1c6b24af0MD51CC-LICENSElicense_rdflicense_rdfapplication/rdf+xml; charset=utf-8701https://repositorio.cuc.edu.co/bitstreams/7bec2189-fad2-4ff2-97af-6c4c761c4174/download42fd4ad1e89814f5e4a476b409eb708cMD52LICENSElicense.txtlicense.txttext/plain; charset=utf-83196https://repositorio.cuc.edu.co/bitstreams/400d921a-2ba8-4c0a-a772-2c2f05978238/downloade30e9215131d99561d40d6b0abbe9badMD53THUMBNAILAddressing the Permutational Flow Shop Scheduling Problem Through Constructive Heuristics A Statistical Comparison.pdf.jpgAddressing the Permutational Flow Shop Scheduling Problem Through Constructive Heuristics A Statistical Comparison.pdf.jpgimage/jpeg52648https://repositorio.cuc.edu.co/bitstreams/f62bdf91-e0d4-4dbd-a304-3270245fb7f2/downloada31dae850185e8a753193e19cb0c420dMD54TEXTAddressing the Permutational Flow Shop Scheduling Problem Through Constructive Heuristics A Statistical Comparison.pdf.txtAddressing the Permutational Flow Shop Scheduling Problem Through Constructive Heuristics A Statistical Comparison.pdf.txttext/plain1472https://repositorio.cuc.edu.co/bitstreams/63f6645a-4dee-429f-aab1-b838fa799d03/downloaddaf86c4611523418e6b39106e1086e7cMD5511323/8842oai:repositorio.cuc.edu.co:11323/88422024-09-17 10:53:06.122http://creativecommons.org/publicdomain/zero/1.0/CC0 1.0 Universalopen.accesshttps://repositorio.cuc.edu.coRepositorio de la Universidad de la Costa CUCrepdigital@cuc.edu.coQXV0b3Jpem8gKGF1dG9yaXphbW9zKSBhIGxhIEJpYmxpb3RlY2EgZGUgbGEgSW5zdGl0dWNpw7NuIHBhcmEgcXVlIGluY2x1eWEgdW5hIGNvcGlhLCBpbmRleGUgeSBkaXZ1bGd1ZSBlbiBlbCBSZXBvc2l0b3JpbyBJbnN0aXR1Y2lvbmFsLCBsYSBvYnJhIG1lbmNpb25hZGEgY29uIGVsIGZpbiBkZSBmYWNpbGl0YXIgbG9zIHByb2Nlc29zIGRlIHZpc2liaWxpZGFkIGUgaW1wYWN0byBkZSBsYSBtaXNtYSwgY29uZm9ybWUgYSBsb3MgZGVyZWNob3MgcGF0cmltb25pYWxlcyBxdWUgbWUobm9zKSBjb3JyZXNwb25kZShuKSB5IHF1ZSBpbmNsdXllbjogbGEgcmVwcm9kdWNjacOzbiwgY29tdW5pY2FjacOzbiBww7pibGljYSwgZGlzdHJpYnVjacOzbiBhbCBww7pibGljbywgdHJhbnNmb3JtYWNpw7NuLCBkZSBjb25mb3JtaWRhZCBjb24gbGEgbm9ybWF0aXZpZGFkIHZpZ2VudGUgc29icmUgZGVyZWNob3MgZGUgYXV0b3IgeSBkZXJlY2hvcyBjb25leG9zIHJlZmVyaWRvcyBlbiBhcnQuIDIsIDEyLCAzMCAobW9kaWZpY2FkbyBwb3IgZWwgYXJ0IDUgZGUgbGEgbGV5IDE1MjAvMjAxMiksIHkgNzIgZGUgbGEgbGV5IDIzIGRlIGRlIDE5ODIsIExleSA0NCBkZSAxOTkzLCBhcnQuIDQgeSAxMSBEZWNpc2nDs24gQW5kaW5hIDM1MSBkZSAxOTkzIGFydC4gMTEsIERlY3JldG8gNDYwIGRlIDE5OTUsIENpcmN1bGFyIE5vIDA2LzIwMDIgZGUgbGEgRGlyZWNjacOzbiBOYWNpb25hbCBkZSBEZXJlY2hvcyBkZSBhdXRvciwgYXJ0LiAxNSBMZXkgMTUyMCBkZSAyMDEyLCBsYSBMZXkgMTkxNSBkZSAyMDE4IHkgZGVtw6FzIG5vcm1hcyBzb2JyZSBsYSBtYXRlcmlhLg0KDQpBbCByZXNwZWN0byBjb21vIEF1dG9yKGVzKSBtYW5pZmVzdGFtb3MgY29ub2NlciBxdWU6DQoNCi0gTGEgYXV0b3JpemFjacOzbiBlcyBkZSBjYXLDoWN0ZXIgbm8gZXhjbHVzaXZhIHkgbGltaXRhZGEsIGVzdG8gaW1wbGljYSBxdWUgbGEgbGljZW5jaWEgdGllbmUgdW5hIHZpZ2VuY2lhLCBxdWUgbm8gZXMgcGVycGV0dWEgeSBxdWUgZWwgYXV0b3IgcHVlZGUgcHVibGljYXIgbyBkaWZ1bmRpciBzdSBvYnJhIGVuIGN1YWxxdWllciBvdHJvIG1lZGlvLCBhc8OtIGNvbW8gbGxldmFyIGEgY2FibyBjdWFscXVpZXIgdGlwbyBkZSBhY2Npw7NuIHNvYnJlIGVsIGRvY3VtZW50by4NCg0KLSBMYSBhdXRvcml6YWNpw7NuIHRlbmRyw6EgdW5hIHZpZ2VuY2lhIGRlIGNpbmNvIGHDsW9zIGEgcGFydGlyIGRlbCBtb21lbnRvIGRlIGxhIGluY2x1c2nDs24gZGUgbGEgb2JyYSBlbiBlbCByZXBvc2l0b3JpbywgcHJvcnJvZ2FibGUgaW5kZWZpbmlkYW1lbnRlIHBvciBlbCB0aWVtcG8gZGUgZHVyYWNpw7NuIGRlIGxvcyBkZXJlY2hvcyBwYXRyaW1vbmlhbGVzIGRlbCBhdXRvciB5IHBvZHLDoSBkYXJzZSBwb3IgdGVybWluYWRhIHVuYSB2ZXogZWwgYXV0b3IgbG8gbWFuaWZpZXN0ZSBwb3IgZXNjcml0byBhIGxhIGluc3RpdHVjacOzbiwgY29uIGxhIHNhbHZlZGFkIGRlIHF1ZSBsYSBvYnJhIGVzIGRpZnVuZGlkYSBnbG9iYWxtZW50ZSB5IGNvc2VjaGFkYSBwb3IgZGlmZXJlbnRlcyBidXNjYWRvcmVzIHkvbyByZXBvc2l0b3Jpb3MgZW4gSW50ZXJuZXQgbG8gcXVlIG5vIGdhcmFudGl6YSBxdWUgbGEgb2JyYSBwdWVkYSBzZXIgcmV0aXJhZGEgZGUgbWFuZXJhIGlubWVkaWF0YSBkZSBvdHJvcyBzaXN0ZW1hcyBkZSBpbmZvcm1hY2nDs24gZW4gbG9zIHF1ZSBzZSBoYXlhIGluZGV4YWRvLCBkaWZlcmVudGVzIGFsIHJlcG9zaXRvcmlvIGluc3RpdHVjaW9uYWwgZGUgbGEgSW5zdGl0dWNpw7NuLCBkZSBtYW5lcmEgcXVlIGVsIGF1dG9yKHJlcykgdGVuZHLDoW4gcXVlIHNvbGljaXRhciBsYSByZXRpcmFkYSBkZSBzdSBvYnJhIGRpcmVjdGFtZW50ZSBhIG90cm9zIHNpc3RlbWFzIGRlIGluZm9ybWFjacOzbiBkaXN0aW50b3MgYWwgZGUgbGEgSW5zdGl0dWNpw7NuIHNpIGRlc2VhIHF1ZSBzdSBvYnJhIHNlYSByZXRpcmFkYSBkZSBpbm1lZGlhdG8uDQoNCi0gTGEgYXV0b3JpemFjacOzbiBkZSBwdWJsaWNhY2nDs24gY29tcHJlbmRlIGVsIGZvcm1hdG8gb3JpZ2luYWwgZGUgbGEgb2JyYSB5IHRvZG9zIGxvcyBkZW3DoXMgcXVlIHNlIHJlcXVpZXJhIHBhcmEgc3UgcHVibGljYWNpw7NuIGVuIGVsIHJlcG9zaXRvcmlvLiBJZ3VhbG1lbnRlLCBsYSBhdXRvcml6YWNpw7NuIHBlcm1pdGUgYSBsYSBpbnN0aXR1Y2nDs24gZWwgY2FtYmlvIGRlIHNvcG9ydGUgZGUgbGEgb2JyYSBjb24gZmluZXMgZGUgcHJlc2VydmFjacOzbiAoaW1wcmVzbywgZWxlY3Ryw7NuaWNvLCBkaWdpdGFsLCBJbnRlcm5ldCwgaW50cmFuZXQsIG8gY3VhbHF1aWVyIG90cm8gZm9ybWF0byBjb25vY2lkbyBvIHBvciBjb25vY2VyKS4NCg0KLSBMYSBhdXRvcml6YWNpw7NuIGVzIGdyYXR1aXRhIHkgc2UgcmVudW5jaWEgYSByZWNpYmlyIGN1YWxxdWllciByZW11bmVyYWNpw7NuIHBvciBsb3MgdXNvcyBkZSBsYSBvYnJhLCBkZSBhY3VlcmRvIGNvbiBsYSBsaWNlbmNpYSBlc3RhYmxlY2lkYSBlbiBlc3RhIGF1dG9yaXphY2nDs24uDQoNCi0gQWwgZmlybWFyIGVzdGEgYXV0b3JpemFjacOzbiwgc2UgbWFuaWZpZXN0YSBxdWUgbGEgb2JyYSBlcyBvcmlnaW5hbCB5IG5vIGV4aXN0ZSBlbiBlbGxhIG5pbmd1bmEgdmlvbGFjacOzbiBhIGxvcyBkZXJlY2hvcyBkZSBhdXRvciBkZSB0ZXJjZXJvcy4gRW4gY2FzbyBkZSBxdWUgZWwgdHJhYmFqbyBoYXlhIHNpZG8gZmluYW5jaWFkbyBwb3IgdGVyY2Vyb3MgZWwgbyBsb3MgYXV0b3JlcyBhc3VtZW4gbGEgcmVzcG9uc2FiaWxpZGFkIGRlbCBjdW1wbGltaWVudG8gZGUgbG9zIGFjdWVyZG9zIGVzdGFibGVjaWRvcyBzb2JyZSBsb3MgZGVyZWNob3MgcGF0cmltb25pYWxlcyBkZSBsYSBvYnJhIGNvbiBkaWNobyB0ZXJjZXJvLg0KDQotIEZyZW50ZSBhIGN1YWxxdWllciByZWNsYW1hY2nDs24gcG9yIHRlcmNlcm9zLCBlbCBvIGxvcyBhdXRvcmVzIHNlcsOhbiByZXNwb25zYWJsZXMsIGVuIG5pbmfDum4gY2FzbyBsYSByZXNwb25zYWJpbGlkYWQgc2Vyw6EgYXN1bWlkYSBwb3IgbGEgaW5zdGl0dWNpw7NuLg0KDQotIENvbiBsYSBhdXRvcml6YWNpw7NuLCBsYSBpbnN0aXR1Y2nDs24gcHVlZGUgZGlmdW5kaXIgbGEgb2JyYSBlbiDDrW5kaWNlcywgYnVzY2Fkb3JlcyB5IG90cm9zIHNpc3RlbWFzIGRlIGluZm9ybWFjacOzbiBxdWUgZmF2b3JlemNhbiBzdSB2aXNpYmlsaWRhZA== |