Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Stability of scheduling with random processing times on one machine

100%

Rajba P., Wodecki M.

Applicationes Mathematicae

2012

tom 39

nr 2

169-183

We consider a strong NP-hard single-machine scheduling problem with deadlines and minimizing the total weight of late jobs on a single machine ($1 || ∑{w_iU_i}$). 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.

Ograniczanie wyników

1 Applicationes Mathematicae

1 Rajba P.

1 Wodecki M.

1 2012

Wyniki wyszukiwania

Stability of scheduling with random processing times on one machine