A VNS Algorithm for Noisy Problems and Its Application to Project Portfolio Analysis

DOI10.1007/978-3-540-74871-7_9zbMath1175.90330OpenAlexW131866885MaRDI QIDQ3608501

Peter Reiter, Stefan Katzensteiner, Walter J. Gutjahr

Publication date: 5 March 2009

Published in: Stochastic Algorithms: Foundations and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74871-7_9

zbMATH Keywords

project schedulingvariable neighborhood searchproject portfolio selectionstochastic combinatorial optimizationstaff assignment

Mathematics Subject Classification ID

Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Stochastic scheduling theory in operations research (90B36)

Related Items (12)

Comparison of anticipatory algorithms for a dial-a-ride problem ⋮ Optimal dynamic portfolio selection for projects under a competence development model ⋮ Competence-driven project portfolio selection, scheduling and staff assignment ⋮ Recent trends in metaheuristics for stochastic combinatorial optimization ⋮ Bi-objective project portfolio selection and staff assignment under uncertainty ⋮ Variable neighbourhood search: methods and applications ⋮ Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports ⋮ Multi-objective decision analysis for competence-oriented project portfolio selection ⋮ Metaheuristic search techniques for multi-objective and stochastic problems: a history of the inventions of Walter J. Gutjahr in the past 22 years ⋮ Variable neighborhood search for the stochastic and dynamic vehicle routing problem ⋮ A survey on metaheuristics for stochastic combinatorial optimization ⋮ Variable neighbourhood search: Methods and applications

This page was built for publication: A VNS Algorithm for Noisy Problems and Its Application to Project Portfolio Analysis