A polarized adaptive schedule generation scheme for the resource-constrained project scheduling problem

DOI10.1051/ro/2012006zbMath1241.90060OpenAlexW2068990620MaRDI QIDQ2893339

M. Reza Zamani

Publication date: 20 June 2012

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/222511

zbMATH Keywords

heuristicsresource-constrainedproject-scheduling

Mathematics Subject Classification ID

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

Related Items (3)

A survey of hybrid metaheuristics for the resource-constrained project scheduling problem ⋮ An innovative four-layer heuristic for scheduling multi-mode projects under multiple resource constrains ⋮ A competitive magnet-based genetic algorithm for solving the resource-constrained project scheduling problem

Uses Software

• PSPLIB
• LSSPER

Cites Work

• Unnamed Item
• 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
• A random key based genetic algorithm for the resource constrained project scheduling problem
• A survey of variants and extensions of 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
• Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation
• A genetic algorithm for multi-mode resource constrained project scheduling problem
• PSPLIB -- a project scheduling problem library
• A branch and bound algorithm for the resource-constrained project scheduling problem
• A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations
• The noising method: A new method for combinatorial optimization
• A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version.
• A branch-and-bound algorithm for the resource-constrained project scheduling problem
• Resource-constrained project scheduling: A survey of recent developments.
• Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem
• An effective near-optimal state-space search method: an application to a scheduling problem
• Justification and RCPSP: a technique that pays
• The multiple resource constrained project scheduling problem: A breadth-first approach
• PERT scheduling with convex cost functions.
• A hybrid metaheuristic for the resource-constrained project scheduling problem
• An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation
• Solving Project Scheduling Problems by Minimum Cut Computations
• Scheduling Resource-Constrained Projects Competitively at Modest Memory Requirements
• A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
• A CPM Time-Cost Computational Algorithm for Arbitrary Activity Cost Functions
• A simulated annealing algorithm for resource constrained project scheduling problems
• New Benchmark Results for the Resource-Constrained Project Scheduling Problem
• A self-adapting genetic algorithm for project scheduling under resource constraints
• Adaptive search for solving hard project scheduling problems
• A competitive heuristic solution technique for resource-constrained project scheduling

This page was built for publication: A polarized adaptive schedule generation scheme for the resource-constrained project scheduling problem