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.
|Titolo:||Assessing the quality of heuristic solutions to parallel machines min–max scheduling problems.|
|Data di pubblicazione:||2009|
|Digital Object Identifier (DOI):||http://dx.doi.org/10.1016/j.ijpe.2009.07.001|
|Appare nelle tipologie:||1.1 Articolo in rivista|
File in questo prodotto: