Improving electromagnetism algorithm for solving resource allocation problem in stochastic networks
From MaRDI portal
Publication:1652374
DOI10.1016/j.cor.2017.04.009zbMath1391.90442OpenAlexW2608081062MaRDI QIDQ1652374
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2017.04.009
Stochastic programming (90C15) Stochastic network models in operations research (90B15) Approximation methods and heuristics in mathematical programming (90C59) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Cites Work
- The discrete time-cost tradeoff problem revisited
- Optimal procedures for the discrete time/cost trade-off problem in project networks
- On the optimal management of project risk
- On the convergence of a population-based global optimization algorithm
- An electromagnetism-like mechanism for global optimization
- Resource allocation via dynamic programming in activity networks
- A new approximation algorithm for obtaining the probability distribution function for project completion time
- A multi-objective resource allocation problem in PERT networks
- A Network Flow Computation for Project Cost Curves
- Project Scheduling with Continuously-Divisible, Doubly Constrained Resources
- A Horizon-Varying, Zero-One Approach to Project Scheduling
- A Dynamic Programming Solution to Cost-Time Tradeoff for CPM
- A Dynamic Programming Algorithm for Decision CPM Networks
- Markov and Markov-Regenerative <scp>pert</scp> Networks
- Critical Path Problems with Concave Cost-Time Curves
- Optimal resource allocation with minimum activation levels and fixed costs
- Unnamed Item
- Unnamed Item
This page was built for publication: Improving electromagnetism algorithm for solving resource allocation problem in stochastic networks