Finding the shortest path with honey-bee mating optimization algorithm in project management problems with constrained/unconstrained resources
From MaRDI portal
Publication:707776
DOI10.1007/s10589-008-9210-9zbMath1202.90125OpenAlexW2079583296MaRDI QIDQ707776
Mahsa Mirmomeni, Mahboubeh Zarezadeh Mehrizi, Miguel A. Mariño, Omid Bozorg Haddad
Publication date: 8 October 2010
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-008-9210-9
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Honey-bee mating optimization (HBMO) algorithm for optimal reservoir operation
- A tabu search algorithm for the open shop scheduling problem
- A tabu search procedure for the resource constrained project scheduling problem with discounted cash flows
- An exact algorithm for project scheduling with multiple modes
- PROGRESS: Optimally solving the generalized resource-constrained project scheduling problem
- A branch and bound algorithm for the robust shortest path problem with interval data.
- Solving a large-scale industrial scheduling problem using MILP combined with a heuristic procedure
- A hybrid genetic algorithm for the single machine scheduling problem
- An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation
- Dynamic programming algorithms for the elementary shortest path problem with resource constraints
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel Algorithms for Dynamic Shortest Path Problems
This page was built for publication: Finding the shortest path with honey-bee mating optimization algorithm in project management problems with constrained/unconstrained resources
