A stochastic greedy algorithm for the resource-constrained project scheduling problem

MaRDI QIDQ5264737zbMATH OpenFDO

Authors E. N. Goncharov

Publication date 27 July 2015

Full work available at URL http://mathnet.ru/eng/da772

zbMATH Keywords

heuristic algorithmlimited resourceresource constrained project scheduling problemrenewable resource

Mathematics Subject Classification ID

Applications of statistics to economics (62P20) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• When it is worthwhile to work with the stochastic RCPSP?
• On some implementations of solving the resource constrained project scheduling problems
• A branch and bound algorithm for the resource-constrained project scheduling problem
• Genetic algorithm for the resource-constrained project scheduling problem
• New strategies for stochastic resource-constrained project scheduling

Cited in

(8)

• A 3/2-approximation for big two-bar charts packing
• Two-bar charts packing problem
• When it is worthwhile to work with the stochastic RCPSP?
• A population-based approach to the resource-constrained project scheduling problem
• Going to the core of hard resource-constrained project scheduling instances
• Solving stochastic resource-constrained project scheduling problems by closed-loop approximate dynamic programming
• Genetic algorithm for the resource-constrained project scheduling problem
• Approximate policy iteration for dynamic resource-constrained project scheduling

This page was built for publication: A stochastic greedy algorithm for the resource-constrained project scheduling problem

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