An efficient genetic algorithm to solve the resource-constrained project scheduling problem with transfer times: the single mode case

DOI10.1016/j.ejor.2017.07.027zbMath1374.90158OpenAlexW2735745260MaRDI QIDQ1681264

Roubila Lilia Kadri, Fayez F. Boctor

Publication date: 23 November 2017

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

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

zbMATH Keywords

project schedulinggenetic algorithmsresource transfer time

Mathematics Subject Classification ID

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

Related Items (8)

An evolutionary approach for resource constrained project scheduling with uncertain changes ⋮ Dynamic resource allocation and collaborative scheduling in R\&D and manufacturing processes of high-end equipment with budget constraint ⋮ A branch-and-bound algorithm for the unit-capacity resource constrained project scheduling problem with transfer times ⋮ Design of computational intelligent procedure for thermal analysis of porous fin model ⋮ An updated survey of variants and extensions of the resource-constrained project scheduling problem ⋮ A column generation-based diving heuristic to solve the multi-project personnel staffing problem with calendar constraints and resource sharing ⋮ An efficient genetic algorithm for decentralized multi-project scheduling with resource transfers ⋮ A tree search heuristic for the resource constrained project scheduling problem with transfer times

Cites Work

• A flow-based tabu search algorithm for the RCPSP with transfer times
• A population-based approach to the resource-constrained project scheduling problem
• Some efficient multi-heuristic procedures for resource-constrained project scheduling
• Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems
• A random key based genetic algorithm for the resource constrained project scheduling problem
• A heuristic solution framework for the resource constrained (multi-)project scheduling problem with sequence-dependent transfer times
• Scheduling subject to resource constraints: Classification and complexity
• Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation
• An efficient optimal solution procedure for the preemptive resource-constrained project scheduling problem
• A branch and bound algorithm for the resource-constrained project scheduling problem
• A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version.
• A competitive magnet-based genetic algorithm for solving the resource-constrained project scheduling problem
• A hybrid scatter search/electromagnetism meta-heuristic for project scheduling
• Une méthode arborescente pour résoudre les problèmes cumulatifs
• Resource-constrained project scheduling by simulated annealing
• Solving the Multi-Mode Resource-Constrained Project Scheduling Problem with genetic algorithms
• A self-adapting genetic algorithm for project scheduling under resource constraints
• Project scheduling with multiple modes: A genetic algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An efficient genetic algorithm to solve the resource-constrained project scheduling problem with transfer times: the single mode case