Ayuda
Ir al contenido

Dialnet


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

Wojciech Bożejko, Pawel Rajba, Mieczysław Wodecki

  • 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.


Fundación Dialnet

Dialnet Plus

  • Más información sobre Dialnet Plus