Bi-Objective Optimization for Uniform Parallel Batch Machine Scheduling under Time-of-Use Tariffs

Junheng Cheng, Jingya Cheng, Feng Chu
{"title":"Bi-Objective Optimization for Uniform Parallel Batch Machine Scheduling under Time-of-Use Tariffs","authors":"Junheng Cheng, Jingya Cheng, Feng Chu","doi":"10.1109/ICNSC55942.2022.10004129","DOIUrl":null,"url":null,"abstract":"Time-of-Use (ToU) electricity pricing scheme has been widely implemented to alleviate the grid's peak load, under which manufacturing companies obtain a good opportunity to save energy cost through more reasonable production scheduling. As a typical production system, batch processing machine manufacturing system has been widely used in modern manufacturing industry because of its advantages in improving production efficiency and reducing production costs. In this work, a new bi-objective uniform parallel batch machine scheduling problem with different job sizes under ToU tariffs is explored, with the goal of minimizing the total electricity cost and the number of enabled machines. We first establish a mixed integer linear programming model, and then propose an improved model. Both models are solved by CPLEX using the $\\varepsilon$-constraint method. The calculation results of randomly generated instances prove the effectiveness of the proposed model. At the same time, the calculation results show that the improved model is more effective than the original one.","PeriodicalId":230499,"journal":{"name":"2022 IEEE International Conference on Networking, Sensing and Control (ICNSC)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE International Conference on Networking, Sensing and Control (ICNSC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNSC55942.2022.10004129","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Time-of-Use (ToU) electricity pricing scheme has been widely implemented to alleviate the grid's peak load, under which manufacturing companies obtain a good opportunity to save energy cost through more reasonable production scheduling. As a typical production system, batch processing machine manufacturing system has been widely used in modern manufacturing industry because of its advantages in improving production efficiency and reducing production costs. In this work, a new bi-objective uniform parallel batch machine scheduling problem with different job sizes under ToU tariffs is explored, with the goal of minimizing the total electricity cost and the number of enabled machines. We first establish a mixed integer linear programming model, and then propose an improved model. Both models are solved by CPLEX using the $\varepsilon$-constraint method. The calculation results of randomly generated instances prove the effectiveness of the proposed model. At the same time, the calculation results show that the improved model is more effective than the original one.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
使用时间关税下统一并行批处理机器调度的双目标优化
为了缓解电网的高峰负荷,分时电价制度得到了广泛的实施,在分时电价制度下,制造企业通过更合理的生产调度获得了节约能源成本的良好机会。批量加工机械制造系统作为一种典型的生产系统,由于其在提高生产效率、降低生产成本等方面的优势,在现代制造业中得到了广泛的应用。本文研究了在分时电价条件下具有不同作业规模的双目标统一并行批处理机器调度问题,其目标是使总电力成本和使能机器数量最小。首先建立了一个混合整数线性规划模型,然后提出了一个改进模型。这两个模型都是用CPLEX的$\varepsilon$约束方法求解的。随机生成实例的计算结果证明了该模型的有效性。同时,计算结果表明,改进后的模型比原模型更有效。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
High-dimensional Feature Selection in Classification: A Length-Adaptive Evolutionary Approach SFME: Score Fusion from Multiple Experts for Long-tailed Recognition Attention and Cost-Sensitive Graph Neural Network for Imbalanced Node Classification Conditioning Customers' Product Reviews for Accurate Classification Performance Constraint Programming for Modeling and Solving a Hybrid Flow Shop Scheduling 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