为调度问题中的绿色配置开发算法选择器

Carlos March, Christian Perez, Miguel A. Salido
{"title":"为调度问题中的绿色配置开发算法选择器","authors":"Carlos March, Christian Perez, Miguel A. Salido","doi":"arxiv-2409.08641","DOIUrl":null,"url":null,"abstract":"The Job Shop Scheduling Problem (JSP) is central to operations research,\nprimarily optimizing energy efficiency due to its profound environmental and\neconomic implications. Efficient scheduling enhances production metrics and\nmitigates energy consumption, thus effectively balancing productivity and\nsustainability objectives. Given the intricate and diverse nature of JSP\ninstances, along with the array of algorithms developed to tackle these\nchallenges, an intelligent algorithm selection tool becomes paramount. This\npaper introduces a framework designed to identify key problem features that\ncharacterize its complexity and guide the selection of suitable algorithms.\nLeveraging machine learning techniques, particularly XGBoost, the framework\nrecommends optimal solvers such as GUROBI, CPLEX, and GECODE for efficient JSP\nscheduling. GUROBI excels with smaller instances, while GECODE demonstrates\nrobust scalability for complex scenarios. The proposed algorithm selector\nachieves an accuracy of 84.51\\% in recommending the best algorithm for solving\nnew JSP instances, highlighting its efficacy in algorithm selection. By\nrefining feature extraction methodologies, the framework aims to broaden its\napplicability across diverse JSP scenarios, thereby advancing efficiency and\nsustainability in manufacturing logistics.","PeriodicalId":501479,"journal":{"name":"arXiv - CS - Artificial Intelligence","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Developing an Algorithm Selector for Green Configuration in Scheduling Problems\",\"authors\":\"Carlos March, Christian Perez, Miguel A. Salido\",\"doi\":\"arxiv-2409.08641\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Job Shop Scheduling Problem (JSP) is central to operations research,\\nprimarily optimizing energy efficiency due to its profound environmental and\\neconomic implications. Efficient scheduling enhances production metrics and\\nmitigates energy consumption, thus effectively balancing productivity and\\nsustainability objectives. Given the intricate and diverse nature of JSP\\ninstances, along with the array of algorithms developed to tackle these\\nchallenges, an intelligent algorithm selection tool becomes paramount. This\\npaper introduces a framework designed to identify key problem features that\\ncharacterize its complexity and guide the selection of suitable algorithms.\\nLeveraging machine learning techniques, particularly XGBoost, the framework\\nrecommends optimal solvers such as GUROBI, CPLEX, and GECODE for efficient JSP\\nscheduling. GUROBI excels with smaller instances, while GECODE demonstrates\\nrobust scalability for complex scenarios. The proposed algorithm selector\\nachieves an accuracy of 84.51\\\\% in recommending the best algorithm for solving\\nnew JSP instances, highlighting its efficacy in algorithm selection. By\\nrefining feature extraction methodologies, the framework aims to broaden its\\napplicability across diverse JSP scenarios, thereby advancing efficiency and\\nsustainability in manufacturing logistics.\",\"PeriodicalId\":501479,\"journal\":{\"name\":\"arXiv - CS - Artificial Intelligence\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-09-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Artificial Intelligence\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2409.08641\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Artificial Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.08641","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

作业车间调度问题(JSP)是运筹学的核心问题,主要是优化能源效率,因为它对环境和经济有着深远的影响。高效的调度可以提高生产指标,减少能源消耗,从而有效平衡生产率和可持续发展目标。鉴于 JSPinstances 复杂多样的性质,以及为应对这些挑战而开发的一系列算法,智能算法选择工具变得至关重要。利用机器学习技术,特别是 XGBoost,该框架推荐了 GUROBI、CPLEX 和 GECODE 等最优解算器,用于高效的 JSP 调度。GUROBI 在较小的实例中表现出色,而 GECODE 则在复杂的场景中表现出强大的可扩展性。所提出的算法选择器在为解决新的 JSP 实例推荐最佳算法方面达到了 84.51% 的准确率,突出了其在算法选择方面的功效。通过改进特征提取方法,该框架旨在扩大其在各种 JSP 场景中的适用性,从而提高制造物流的效率和可持续性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Developing an Algorithm Selector for Green Configuration in Scheduling Problems
The Job Shop Scheduling Problem (JSP) is central to operations research, primarily optimizing energy efficiency due to its profound environmental and economic implications. Efficient scheduling enhances production metrics and mitigates energy consumption, thus effectively balancing productivity and sustainability objectives. Given the intricate and diverse nature of JSP instances, along with the array of algorithms developed to tackle these challenges, an intelligent algorithm selection tool becomes paramount. This paper introduces a framework designed to identify key problem features that characterize its complexity and guide the selection of suitable algorithms. Leveraging machine learning techniques, particularly XGBoost, the framework recommends optimal solvers such as GUROBI, CPLEX, and GECODE for efficient JSP scheduling. GUROBI excels with smaller instances, while GECODE demonstrates robust scalability for complex scenarios. The proposed algorithm selector achieves an accuracy of 84.51\% in recommending the best algorithm for solving new JSP instances, highlighting its efficacy in algorithm selection. By refining feature extraction methodologies, the framework aims to broaden its applicability across diverse JSP scenarios, thereby advancing efficiency and sustainability in manufacturing logistics.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Abductive explanations of classifiers under constraints: Complexity and properties Explaining Non-monotonic Normative Reasoning using Argumentation Theory with Deontic Logic Towards Explainable Goal Recognition Using Weight of Evidence (WoE): A Human-Centered Approach A Metric Hybrid Planning Approach to Solving Pandemic Planning Problems with Simple SIR Models Neural Networks for Vehicle Routing Problem
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1