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

引用次数: 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.

查看原文本刊更多论文

分块型双机总加权延迟流车间调度问题

本文讨论了一类具有延迟代价总和最小的双机流水车间问题，作为普遍存在的具有此准则的单机np困难问题的推广。我们建议引入新的消除块属性，以加速局部搜索近似算法的运行，解决这一问题，并提高由它们确定的解的质量。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Bulletin of the Polish Academy of Sciences-Technical Sciences 工程技术-工程：综合

CiteScore

2.80

自引率

16.70%

发文量

审稿时长

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.