Blocks of Jobs for Solving Two-Machine Flow Shop Problem with Normal Distributed Processing Times

• Wojciech Bożejko ^[1] ; Paweł Rajba ^[2] ; Mieczysław Wodecki ^[1]
  1. [1] Wrocław University of Technology

     Wrocław University of Technology

     Breslavia, Polonia

     
  2. [2] University of Wrocław

     University of Wrocław

     Breslavia, Polonia

     
• Localización: 15th International Conference on Soft Computing Models in Industrial and Environmental Applications (SOCO 2020): Burgos, Spain ; September 2020 / coord. por Álvaro Herrero Cosío, Carlos Cambra Baseca, Daniel Urda Muñoz, Javier Sedano Franco, Héctor Quintián Pardo, Emilio Santiago Corchado Rodríguez, 2021, ISBN 978-3-030-57802-2, págs. 289-298
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • We consider strongly NP-hard problem of two-machine task scheduling with due dates and minimizing of the total weighted tardiness. Task execution times are random variables. We propose methods of intermediate review of solutions, the so-called ‘block properties’, which we use in the tabu search algorithm. From computational experiments carried out it follows that the use of blocks significantly speeds up calculations.