TY - JOUR N2 - 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. L1 - http://journals.pan.pl/Content/115156/PDF/02_31-41_01348_Bpast.No.68-1_28.02.20_K1_OK_TeX.pdf L2 - http://journals.pan.pl/Content/115156 PY - 2020 IS - No. 1 EP - 41 DO - 10.24425/bpasts.2020.131829 KW - flow shop KW - two machine KW - due date KW - minimal costs KW - blocks of tasks KW - parallel algorithm A1 - Bożejko, W. A1 - Uchroński, M. A1 - Wodecki, M. VL - 68 DA - 29.02.2020 T1 - Blocks for two-machines total weighted tardiness flow shop scheduling problem SP - 31 UR - http://journals.pan.pl/dlibra/publication/edition/115156 T2 - Bulletin of the Polish Academy of Sciences Technical Sciences ER -