Energy-aware flow shop scheduling with uncertain renewable energy

IF 4.1 2区 工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Computers & Operations Research Pub Date : 2024-07-02 DOI:10.1016/j.cor.2024.106741
Masoumeh Ghorbanzadeh , Morteza Davari , Mohammad Ranjbar
{"title":"Energy-aware flow shop scheduling with uncertain renewable energy","authors":"Masoumeh Ghorbanzadeh ,&nbsp;Morteza Davari ,&nbsp;Mohammad Ranjbar","doi":"10.1016/j.cor.2024.106741","DOIUrl":null,"url":null,"abstract":"<div><p>This paper investigates an energy-aware flow shop scheduling problem with on-site renewable and grid energy resources. To deal with the uncertainty of renewable energy resources, we first develop two two-stage stochastic programming formulations based on pulse and step models to minimize the total energy cost purchased from the grid. Next, we develop two robust models where in the first one we assume the cost of buying energy from the grid is limited to a given budget and we aim to maximize the number of scenarios that comply with this limitation. In the second robust model, we aim to minimize the grid energy cost by considering a predetermined confidence level. To solve the stochastic and robust models, we develop Benders decomposition algorithms and incorporate the warm-up technique for Benders algorithm. Computational experiments on randomly generated test instances demonstrate that the step formulation outperforms the pulse formulation for larger instances. Additionally, each developed Benders decomposition algorithm outperforms its corresponding model, and the warm-up technique improves the performance of the Benders decomposition algorithms.</p></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":null,"pages":null},"PeriodicalIF":4.1000,"publicationDate":"2024-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Operations Research","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0305054824002132","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

This paper investigates an energy-aware flow shop scheduling problem with on-site renewable and grid energy resources. To deal with the uncertainty of renewable energy resources, we first develop two two-stage stochastic programming formulations based on pulse and step models to minimize the total energy cost purchased from the grid. Next, we develop two robust models where in the first one we assume the cost of buying energy from the grid is limited to a given budget and we aim to maximize the number of scenarios that comply with this limitation. In the second robust model, we aim to minimize the grid energy cost by considering a predetermined confidence level. To solve the stochastic and robust models, we develop Benders decomposition algorithms and incorporate the warm-up technique for Benders algorithm. Computational experiments on randomly generated test instances demonstrate that the step formulation outperforms the pulse formulation for larger instances. Additionally, each developed Benders decomposition algorithm outperforms its corresponding model, and the warm-up technique improves the performance of the Benders decomposition algorithms.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
具有不确定可再生能源的能源感知流程车间调度
本文研究了一个具有现场可再生能源和电网能源资源的能源感知流程车间调度问题。为应对可再生能源的不确定性,我们首先基于脉冲模型和阶跃模型开发了两个两阶段随机编程公式,以最小化从电网购买能源的总成本。接下来,我们开发了两个稳健模型,在第一个模型中,我们假设从电网购买能源的成本仅限于给定的预算,我们的目标是使符合这一限制的方案数量最大化。在第二个稳健模型中,我们的目标是通过考虑预先确定的置信度,使电网能源成本最小化。为了解决随机模型和鲁棒模型,我们开发了本德尔分解算法,并为本德尔算法加入了预热技术。在随机生成的测试实例上进行的计算实验表明,对于较大的实例,步进公式优于脉冲公式。此外,所开发的每种 Benders 分解算法都优于其相应的模型,而预热技术则提高了 Benders 分解算法的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Computers & Operations Research
Computers & Operations Research 工程技术-工程:工业
CiteScore
8.60
自引率
8.70%
发文量
292
审稿时长
8.5 months
期刊介绍: Operations research and computers meet in a large number of scientific fields, many of which are of vital current concern to our troubled society. These include, among others, ecology, transportation, safety, reliability, urban planning, economics, inventory control, investment strategy and logistics (including reverse logistics). Computers & Operations Research provides an international forum for the application of computers and operations research techniques to problems in these and related fields.
期刊最新文献
Corporate risk stratification through an interpretable autoencoder-based model Re-direction in queueing networks with two customer types: The inter-departure analysis Multi objective optimization of human–robot collaboration: A case study in aerospace assembly line A deep reinforcement learning hyperheuristic for the covering tour problem with varying coverage Arc-flow formulation and branch-and-price-and-cut algorithm for the bin-packing problem with fragile objects
×
引用
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