{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/an-ant-colony-optimization-algorithm-for-job","title":"An ant colony optimization algorithm for job shop scheduling problem","arxiv_id":"1309.5110","date":"2013-09-19","proceeding":null,"authors":["Edson Flórez","Wilfredo Gómez","Lola Bautista"],"abstract":"The nature has inspired several metaheuristics, outstanding among these is\nAnt Colony Optimization (ACO), which have proved to be very effective and\nefficient in problems of high complexity (NP-hard) in combinatorial\noptimization. This paper describes the implementation of an ACO model algorithm\nknown as Elitist Ant System (EAS), applied to a combinatorial optimization\nproblem called Job Shop Scheduling Problem (JSSP). We propose a method that\nseeks to reduce delays designating the operation immediately available, but\nconsidering the operations that lack little to be available and have a greater\namount of pheromone. The performance of the algorithm was evaluated for\nproblems of JSSP reference, comparing the quality of the solutions obtained\nregarding the best known solution of the most effective methods. The solutions\nwere of good quality and obtained with a remarkable efficiency by having to\nmake a very low number of objective function evaluations.","url_abs":"http://arxiv.org/abs/1309.5110v1","url_pdf":"http://arxiv.org/pdf/1309.5110v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"an-ant-colony-optimization-algorithm-for-job","repo_url":"https://github.com/thomasWeise/jsspInstancesAndResults","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null}],"tasks":[{"task_slug":"combinatorial-optimization","task_name":"Combinatorial Optimization"},{"task_slug":"job-shop-scheduling","task_name":"Job Shop Scheduling"},{"task_slug":"scheduling","task_name":"Scheduling"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}