An efficient particle swarm optimizer with application to man-day project scheduling problems
From MaRDI portal
Publication:1718586
DOI10.1155/2014/519414zbMath1407.90147OpenAlexW2099338763WikidataQ59068167 ScholiaQ59068167MaRDI QIDQ1718586
Frode Eika Sandnes, Ruey-Maw Chen
Publication date: 8 February 2019
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2014/519414
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Hybrid particle swarm and differential evolution algorithm for solving multimode resource-constrained project scheduling problem, Solving Multi-Mode Resource-Constrained Multi-Project Scheduling Problem with Combinatorial Auction Mechanisms
Uses Software
Cites Work
- Project scheduling heuristics-based standard PSO for task-resource assignment in heterogeneous grid
- Priority rule-based heuristic for multi-mode resource-constrained project scheduling problems with resource vacations and activity splitting
- The museum visitor routing problem
- A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem
- Scheduling subject to resource constraints: Classification and complexity
- PSPLIB -- a project scheduling problem library
- A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems
- A hybrid scatter search for the discrete time/resource trade-off problem in project scheduling
- Tabu Search—Part I
- Tabu Search—Part II
- Solving the Multi-Mode Resource-Constrained Project Scheduling Problem with genetic algorithms
- Simulated annealing for multi-mode resource-constrained project scheduling
- Unnamed Item