@ARTICLE{Bożejko_W._Blocks_2020, author={Bożejko, W. and Uchroński, M. and Wodecki, M.}, volume={68}, number={No. 1}, journal={Bulletin of the Polish Academy of Sciences Technical Sciences}, pages={31-41}, howpublished={online}, year={2020}, 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.}, type={Artykuły / Articles}, title={Blocks for two-machines total weighted tardiness flow shop scheduling problem}, URL={http://www.journals.pan.pl/Content/115156/PDF/02_31-41_01348_Bpast.No.68-1_28.02.20_K1_OK_TeX.pdf}, doi={10.24425/bpasts.2020.131829}, keywords={flow shop, two machine, due date, minimal costs, blocks of tasks, parallel algorithm}, }