An empirical analysis of a set of hybrid heuristics for the solution of the resource leveling problem

DOI10.1007/s43069-023-00283-8OpenAlexW4390539801MaRDI QIDQ6200804

Andreas C. Nearchou, Marinos Aristotelous

Publication date: 20 February 2024

Published in: SN Operations Research Forum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s43069-023-00283-8

zbMATH Keywords

smoothingschedulingcombinatorial optimizationmetaheuristicsevolutionary algorithmsswarm intelligenceresourcesprojectleveling

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A genetic algorithm for the robust resource leveling problem
• An improved ant colony optimization algorithm for nonlinear resource-leveling problems
• A survey of variants and extensions of the resource-constrained project scheduling problem
• Scheduling subject to resource constraints: Classification and complexity
• Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
• Project scheduling. A research handbook.
• Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem
• Optimal project duration for resource leveling
• Resource levelling for projects with schedule-dependent time windows
• Review on nature-inspired algorithms
• Multisite and multishift personnel planning with set-up costs
• The alpha male genetic algorithm
• Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
• Benchmarking optimization software with performance profiles.

This page was built for publication: An empirical analysis of a set of hybrid heuristics for the solution of the resource leveling problem