Showing papers by "Silvano Martello published in 1996"
TL;DR: Two classical algorithms, independently obtained in these two domains, implement a technique developed in 1931 by Egervary, which is shown to implement a combinatorial optimization problem arising in scheduling theory and in satellite communication theory.
12 citations
01 Jan 1996
TL;DR: A tabu search approach is studied to the approximate solution of the problem of scheduling a set of n tasks on a single processor and it is shown that instance with n = 300 are effectively solved with short computing times.
Abstract: We consider the problem of scheduling a set of n tasks on a single processor. Each task has a processing time, a deadline, a flow time penalty and an earliness penalty. The objective is to minimize the total cost incurred by the penalties. The problem is NP-hard in the strong sense. Exact enumerative algorithms from the literature can solve random instances with n ≤ 50. We study a tabu search approach to the approximate solution of the problem and show, through computational experiments, that instance with n = 300 are effectively solved with short computing times.
2 citations