A variable neighborhood tabu search algorithm for project robust scheduling problems

MaRDI QIDQ5277151zbMATH OpenFDO

Authors H. Liang, Yukang He

Publication date 14 July 2017

zbMATH Keywords

robustnessoptimization modeltabu searchvariable neighborhood searchproject scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Search theory (90B40)

Recommendations

• Robust scheduling and robustness measures for the discrete time/cost trade-off problem
• A review of studies on robust project scheduling under uncertainty
• scientific article; zbMATH DE number 2047436
• Using tabu search to schedule activities of stochastic resource-constrained projects
• Robust optimization models for project scheduling with resource availability cost

Cited in

(4)

• Tabu search for proactive project scheduling problem with flexible resources
• scientific article; zbMATH DE number 2047436 (Why is no real title available?)
• Robust solutions for the software project scheduling problem: a preliminary analysis
• A VNS Algorithm for Noisy Problems and Its Application to Project Portfolio Analysis

This page was built for publication: A variable neighborhood tabu search algorithm for project robust scheduling problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5277151)