{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"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":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"thomasWeise/jsspInstancesAndResults","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"7258e918fe691017380071b2f7846ead3fa518b1d8190564a4f905c9b8fe7b41","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}