dc.creatorPedro Pérez Villanueva
dc.date2008-10
dc.date.accessioned2023-07-20T18:56:57Z
dc.date.available2023-07-20T18:56:57Z
dc.identifierhttp://comimsa.repositorioinstitucional.mx/jspui/handle/1022/391
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/7721157
dc.descriptionThis paper presents the application of common heuristics, random search and evolutionary algorithms with representation of random keys and permutations in order to compare as techniques of optimization for the machine sequence planning in a real scenario considering multiples precedence. The results indicate a compromise that the user must take between the quality of the solution and the processing time.
dc.formatapplication/pdf
dc.languageeng
dc.relationcitation:EXPLORATION OF OPTIMIZATION TECHNIQUES FOR THE MACHINE SEQUENCE PLANNING (OPEN SHOP AND JOB SHOP) WITH MULTIPLE PRECEDENCES: A REAL SCENARIO Javier Alejandro Herrera-Zamora1, Luís M. Torres-Treviño, and Pedro Pérez-Villanueva. Proceedings of the 13th Annual International Conference on Industrial Engineering Theory, Applications and Practice Las Vegas, Nevada September 7-10, 2008
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightshttp://creativecommons.org/licenses/by-nc-nd/4.0
dc.subjectinfo:eu-repo/classification/ARTÍCULO/OPEN SHOP AND JOB SHOP
dc.subjectinfo:eu-repo/classification/cti/7
dc.subjectinfo:eu-repo/classification/cti/7
dc.titleEXPLORATION OF OPTIMIZATION TECHNIQUES FOR THE MACHINE SEQUENCE PLANNING (OPEN SHOP AND JOB SHOP) WITH MULTIPLE PRECEDENCES: A REAL SCENARIO
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion
dc.audiencestudents
dc.audienceresearchers


Este ítem pertenece a la siguiente institución