Solving the resource-constrained project scheduling problem using filter-and-fan approach
From MaRDI portal
Publication:945251
DOI10.1016/j.amc.2007.12.025zbMath1152.90463OpenAlexW2003440642MaRDI QIDQ945251
Publication date: 12 September 2008
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2007.12.025
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
A filter-and-fan approach with adaptive neighborhood switching for resource-constrained project scheduling, Reducing network and computation complexities in neural based real-time scheduling scheme, Resource tardiness weighted cost minimization in project scheduling, A neurogenetic approach for the resource-constrained project scheduling problem
Uses Software
Cites Work
- LSSPER: Solving the resource-constrained project scheduling problem with large neighbourhood search
- A population-based approach to the resource-constrained project scheduling problem
- Experimental investigation of heuristics for resource-constrained project scheduling: an update
- Scheduling subject to resource constraints: Classification and complexity
- Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation
- A branch and bound algorithm for the resource-constrained project scheduling problem
- Resource-constrained project scheduling: A critical activity reordering heuristic
- Resource-constrained project scheduling: A survey of recent developments.
- Project scheduling. A research handbook.
- Solving the resource-constrained project scheduling problem by a variable neighbourhood search.
- A hybrid scatter search/electromagnetism meta-heuristic for project scheduling
- An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation
- Scheduling Resource-Constrained Projects Competitively at Modest Memory Requirements
- A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
- Ejection chain and filter-and-fan methods in combinatorial optimization