A competitive magnet-based genetic algorithm for solving the resource-constrained project scheduling problem

DOI10.1016/j.ejor.2013.03.005zbMath1317.90339OpenAlexW2084446444MaRDI QIDQ2355885

M. Reza Zamani

Publication date: 28 July 2015

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2013.03.005

zbMATH Keywords

project schedulinggenetic algorithmsresource-constrainedcrossover operatorsprecedence-based permutation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (13)

Multi-mode resource availability cost problem with recruitment and release dates for resources ⋮ Scheduling resource-constrained projects with a flexible project structure ⋮ A filter-and-fan approach with adaptive neighborhood switching for resource-constrained project scheduling ⋮ An efficient genetic algorithm to solve the resource-constrained project scheduling problem with transfer times: the single mode case ⋮ An Improved Genetic Algorithm for the Resource-Constrained Project Scheduling Problem ⋮ A branch-and-bound algorithm for the unit-capacity resource constrained project scheduling problem with transfer times ⋮ Unnamed Item ⋮ Towards merging binary integer programming techniques with genetic algorithms ⋮ A survey of hybrid metaheuristics for the resource-constrained project scheduling problem ⋮ Fuzzy multi-objective chance-constrained programming model for hazardous materials transportation ⋮ A tree search heuristic for the resource constrained project scheduling problem with transfer times ⋮ On the use of genetic programming to evolve priority rules for resource constrained project scheduling problems ⋮ Activities planning and resources assignment on distinct places: a mathematical model

Uses Software

• PSPLIB
• LSSPER

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers
• Time and work generalised precedence relationships in project scheduling with pre-emption: an application to the management of service centres
• Scheduling and constraint propagation
• LSSPER: Solving the resource-constrained project scheduling problem with large neighbourhood search
• A population-based approach to the resource-constrained project scheduling problem
• Some efficient multi-heuristic procedures for resource-constrained project scheduling
• Experimental investigation of heuristics for resource-constrained project scheduling: an update
• A random key based genetic algorithm for the resource constrained project scheduling problem
• Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem
• An iterative scheduling technique for resource-constrained project scheduling
• PSPLIB -- a project scheduling problem library
• Resource-constrained project scheduling: A critical activity reordering heuristic
• Justification and RCPSP: a technique that pays
• Proactive policies for the stochastic resource-constrained project scheduling problem
• A hybrid genetic algorithm for the resource-constrained project scheduling problem
• A hybrid scatter search/electromagnetism meta-heuristic for project scheduling
• A polarized adaptive schedule generation scheme for the resource-constrained project scheduling problem
• A Decomposition-Based Genetic Algorithm for the Resource-Constrained Project-Scheduling Problem
• A self-adapting genetic algorithm for project scheduling under resource constraints
• A competitive heuristic solution technique for resource-constrained project scheduling
• A robust genetic algorithm for resource allocation in project scheduling

This page was built for publication: A competitive magnet-based genetic algorithm for solving the resource-constrained project scheduling problem