Breslavia, Polonia
Breslavia, Polonia
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.
© 2001-2024 Fundación Dialnet · Todos los derechos reservados