We consider a strong NP-hard single-machine scheduling problem with deadlines and minimizing the total weight of late jobs on a single machine (). Processing times are deterministic values or random variables having Erlang distributions. For this problem we study the tolerance to random parameter changes for solutions constructed according to tabu search metaheuristics. We also present a measure (called stability) that allows an evaluation of the algorithm based on its resistance to random parameter changes. Our experiments prove that random model solutions are more stable than the deterministic model ones.
@article{bwmeta1.element.bwnjournal-article-doi-10_4064-am39-2-5,
author = {Pawe\l\ Rajba and Mieczys\l aw Wodecki},
title = {Stability of scheduling with random processing times on one machine},
journal = {Applicationes Mathematicae},
volume = {39},
year = {2012},
pages = {169-183},
zbl = {1242.90085},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_4064-am39-2-5}
}
Paweł Rajba; Mieczysław Wodecki. Stability of scheduling with random processing times on one machine. Applicationes Mathematicae, Tome 39 (2012) pp. 169-183. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_4064-am39-2-5/