An ACO approach for the parallel machines scheduling problem

dc.creatorGatica, Claudia Ruth
dc.creatorEsquivel, Susana Cecilia
dc.creatorLeguizamon, Mario Guillermo
dc.date.accessioned2022-06-03T16:57:02Z
dc.date.accessioned2022-10-15T16:08:00Z
dc.date.available2022-06-03T16:57:02Z
dc.date.available2022-10-15T16:08:00Z
dc.date.created2022-06-03T16:57:02Z
dc.date.issued2010-06
dc.identifierGatica, Claudia Ruth; Esquivel, Susana Cecilia; Leguizamon, Mario Guillermo; An ACO approach for the parallel machines scheduling problem; Sociedad Iberoamericana de Inteligencia Artificial; Inteligencia Artificial; 14; 46; 6-2010; 84-95
dc.identifier1137-3601
dc.identifierhttp://hdl.handle.net/11336/158911
dc.identifier1988-3064
dc.identifierCONICET Digital
dc.identifierCONICET
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/4407025
dc.description.abstractThe parallel machines scheduling problem (PMSP) comprises the allocation of jobs on the resources of the systems, i.e., a group of machines in parallel. The basic model consists of m identical machines and n jobs. The jobs are assigned according to resource availability following some allocation rule. In this work, we apply the Ant Colony Optimization (ACO) metaheuristic which includes four different specific heuristics in the solution construction process to solve unrestricted PMSP for the minimization of the Maximum Tardiness (Tmax) objective. We also present a comparison of previous results obtained by a simple Genetic Algorithm (GAs), and an evidence of an improved performance of the ACO metaheuristic on this particular scheduling problem.
dc.languageeng
dc.publisherSociedad Iberoamericana de Inteligencia Artificial
dc.relationinfo:eu-repo/semantics/altIdentifier/url/http://journal.iberamia.org/public/Vol.1-14.html
dc.relationinfo:eu-repo/semantics/altIdentifier/doi/https://doi.org/10.4114/intartif.vol14iss48
dc.rightshttps://creativecommons.org/licenses/by-nc/2.5/ar/
dc.rightsinfo:eu-repo/semantics/openAccess
dc.subjectPARALLEL MACHINE SCHEDULING
dc.subjectMAXIMUM TARDINESS
dc.subjectANT COLONY OPTIMIZATION ALGORITHMS
dc.subjectSPECIFIC HEURISTIC PROBLEM INFORMATION
dc.titleAn ACO approach for the parallel machines scheduling problem
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:ar-repo/semantics/artículo
dc.typeinfo:eu-repo/semantics/publishedVersion


Este ítem pertenece a la siguiente institución