Search Results - subject:"randomized regrets"

Complementary, competitive methods for multi-level lot sizing and scheduling: Tabu search and randomized regrets

Kimms, Alf - 1994

This contribution presents two heuristic approaches for multi-level, single-machine lot sizing and scheduling. The first one is a variant of a so-called randomized regret based heuristic which is assumed to be the fastest available method for this particular class of problems. The second...

Persistent link: https://www.econbiz.de/10011613745

Complementary, competitive methods for multi-level lot sizing and scheduling : tabu search and randomized regrets

Kimms, Alf - 1994

Persistent link: https://www.econbiz.de/10011739689

Sequential-analysis-based randomized-regret-methods for lotsizing and scheduling

Drexl, Andreas; Haase, Knut - 1993

biased sampling via randomized regrets is presented. We partition the parameter space of the stochastic algorithm and choose … subspaces via sequential analysis based on hypothesis testing. The new ideas provided in this paper, i.e. the randomized-regrets …

Persistent link: https://www.econbiz.de/10011613728

Sequential-analysis-based randomized-regret-methods for lotsizing and scheduling

Drexl, Andreas; Haase, Knut - 1993

Persistent link: https://www.econbiz.de/10011739121