In this paper, we propose a tool for testing the quality of heuristic solutions for scheduling problems with a min–max objective function, such as, for example, the minimization of maximum tardiness or makespan. We present a bounding scheme which is powerful enough to allow an accurate quality assessment of the available solutions in most cases of practical relevance. In order to validate the effectiveness of our assessment approach, we discuss a real-life application and perform experimental tests on the actual applicative scenario and on possible future scenarios.

Assessing the quality of heuristic solutions to parallel machines min–max scheduling problems / Agnetis, A; Alfieri, Arianna; Nicosia, G.. - In: INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS. - ISSN 0925-5273. - STAMPA. - 122:2(2009), pp. 755-762. [10.1016/j.ijpe.2009.07.001]

Assessing the quality of heuristic solutions to parallel machines min–max scheduling problems.

ALFIERI, Arianna;
2009

Abstract

In this paper, we propose a tool for testing the quality of heuristic solutions for scheduling problems with a min–max objective function, such as, for example, the minimization of maximum tardiness or makespan. We present a bounding scheme which is powerful enough to allow an accurate quality assessment of the available solutions in most cases of practical relevance. In order to validate the effectiveness of our assessment approach, we discuss a real-life application and perform experimental tests on the actual applicative scenario and on possible future scenarios.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11583/2284854
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo