Joel Antonio Trejo-Sánchez , Candelaria E. Sansores , Francisco J. Hernandez-Lopez , Jonás Velasco , Daniel Fajardo Delgado , Jose Luis Lopez-Martinez , Julio Cesar Ramirez-Pacheco
{"title":"MaSchedule。用于调度问题的多代理工具","authors":"Joel Antonio Trejo-Sánchez , Candelaria E. Sansores , Francisco J. Hernandez-Lopez , Jonás Velasco , Daniel Fajardo Delgado , Jose Luis Lopez-Martinez , Julio Cesar Ramirez-Pacheco","doi":"10.1016/j.simpa.2024.100726","DOIUrl":null,"url":null,"abstract":"<div><div>Several scheduling optimization problems belong to the NP-complete class, including, task scheduling, job shop scheduling, and patient admission. These problems commonly require the development of heuristics approaches to find near-optimal solutions within reasonable timeframes. In this work, we present <span>MaSchedule</span> an open-source multi-agent tool for the design of heuristics for scheduling problems.</div></div>","PeriodicalId":29771,"journal":{"name":"Software Impacts","volume":"23 ","pages":"Article 100726"},"PeriodicalIF":1.3000,"publicationDate":"2024-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"MaSchedule. A multi-agent tool for scheduling problems\",\"authors\":\"Joel Antonio Trejo-Sánchez , Candelaria E. Sansores , Francisco J. Hernandez-Lopez , Jonás Velasco , Daniel Fajardo Delgado , Jose Luis Lopez-Martinez , Julio Cesar Ramirez-Pacheco\",\"doi\":\"10.1016/j.simpa.2024.100726\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Several scheduling optimization problems belong to the NP-complete class, including, task scheduling, job shop scheduling, and patient admission. These problems commonly require the development of heuristics approaches to find near-optimal solutions within reasonable timeframes. In this work, we present <span>MaSchedule</span> an open-source multi-agent tool for the design of heuristics for scheduling problems.</div></div>\",\"PeriodicalId\":29771,\"journal\":{\"name\":\"Software Impacts\",\"volume\":\"23 \",\"pages\":\"Article 100726\"},\"PeriodicalIF\":1.3000,\"publicationDate\":\"2024-12-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Software Impacts\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2665963824001143\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Software Impacts","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2665963824001143","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
MaSchedule. A multi-agent tool for scheduling problems
Several scheduling optimization problems belong to the NP-complete class, including, task scheduling, job shop scheduling, and patient admission. These problems commonly require the development of heuristics approaches to find near-optimal solutions within reasonable timeframes. In this work, we present MaSchedule an open-source multi-agent tool for the design of heuristics for scheduling problems.