Blocks for two-machines total weighted tardiness flow shop scheduling problem

IF 1.2 4区 工程技术 Q3 ENGINEERING, MULTIDISCIPLINARY Bulletin of the Polish Academy of Sciences-Technical Sciences Pub Date : 2023-11-06 DOI:10.24425/BPASTS.2020.131829
W. Bożejko, Mariusz Uchroński, M. Wodecki
{"title":"Blocks for two-machines total weighted tardiness flow shop scheduling problem","authors":"W. Bożejko, Mariusz Uchroński, M. Wodecki","doi":"10.24425/BPASTS.2020.131829","DOIUrl":null,"url":null,"abstract":"The paper discusses a two-machine flow shop problem with minimization of the sum of tardiness costs, being a generalization of the popular NP-hard single-machine problem with this criterion. We propose the introduction of new elimination block properties allowing for accelerating the operation of approximate algorithms of local searches, solving this problem and improving the quality of solutions determined by them.","PeriodicalId":55299,"journal":{"name":"Bulletin of the Polish Academy of Sciences-Technical Sciences","volume":"6 1","pages":""},"PeriodicalIF":1.2000,"publicationDate":"2023-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Bulletin of the Polish Academy of Sciences-Technical Sciences","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.24425/BPASTS.2020.131829","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 4

Abstract

The paper discusses a two-machine flow shop problem with minimization of the sum of tardiness costs, being a generalization of the popular NP-hard single-machine problem with this criterion. We propose the introduction of new elimination block properties allowing for accelerating the operation of approximate algorithms of local searches, solving this problem and improving the quality of solutions determined by them.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
分块型双机总加权延迟流车间调度问题
本文讨论了一类具有延迟代价总和最小的双机流水车间问题,作为普遍存在的具有此准则的单机np困难问题的推广。我们建议引入新的消除块属性,以加速局部搜索近似算法的运行,解决这一问题,并提高由它们确定的解的质量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
2.80
自引率
16.70%
发文量
0
审稿时长
6-12 weeks
期刊介绍: The Bulletin of the Polish Academy of Sciences: Technical Sciences is published bimonthly by the Division IV Engineering Sciences of the Polish Academy of Sciences, since the beginning of the existence of the PAS in 1952. The journal is peer‐reviewed and is published both in printed and electronic form. It is established for the publication of original high quality papers from multidisciplinary Engineering sciences with the following topics preferred: Artificial and Computational Intelligence, Biomedical Engineering and Biotechnology, Civil Engineering, Control, Informatics and Robotics, Electronics, Telecommunication and Optoelectronics, Mechanical and Aeronautical Engineering, Thermodynamics, Material Science and Nanotechnology, Power Systems and Power Electronics.
期刊最新文献
148439 148440 Enhancement of COVID-19 symptom-based screening with quality-based classifier optimisation Analyzing and improving tools for supporting fighting against COVID-19 based on prediction models and contact tracing The Effect of Protrusions on the Initiation of Partial Discharges in XLPE High Voltage Cables
×
引用
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