A double genetic algorithm for the MRCPSP/max

DOI10.1016/j.cor.2009.09.019zbMath1231.90175OpenAlexW2091648513MaRDI QIDQ709102

Vicente Valls, Francisco Ballestín, Agustín Barrios

Publication date: 15 October 2010

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2009.09.019

zbMATH Keywords

genetic algorithmmaximum time lagsmulti-mode caseresource-constrained project scheduling

Mathematics Subject Classification ID

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

Related Items (11)

Multi-mode resource availability cost problem with recruitment and release dates for resources ⋮ Modelling and solving generalised operational surgery scheduling problems ⋮ Project scheduling with finite or infinite number of activity processing modes -- a survey ⋮ Time and work generalised precedence relationships in project scheduling with pre-emption: an application to the management of service centres ⋮ Multimode preemptive resource investment problem subject to due dates for activities: formulation and solution procedure ⋮ A practical and robust execution time-frame procedure for the multi-mode resource-constrained project scheduling problem with minimal and maximal time lags ⋮ An updated survey of variants and extensions of the resource-constrained project scheduling problem ⋮ A survey of variants and extensions of the resource-constrained project scheduling problem ⋮ A modified modeling approach and a heuristic procedure for the multi-mode resource constrained project scheduling problem with activity splitting ⋮ Schedule generation scheme for solving multi-mode resource availability cost problem by modified particle swarm optimization ⋮ Solving Multi-Mode Resource-Constrained Multi-Project Scheduling Problem with Combinatorial Auction Mechanisms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Experimental investigation of heuristics for resource-constrained project scheduling: an update
• Resource-constrained project scheduling. Exact methods for the multi-mode case
• Justification and RCPSP: a technique that pays
• Resource-constrained project scheduling: Notation, classification, models, and methods
• The multi-mode resource-constrained project scheduling problem with generalized precedence relations
• A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags
• A Time-Oriented Branch-and-Bound Algorithm for Resource-Constrained Project Scheduling with Generalised Precedence Constraints
• Scheduling of Project Networks by Job Assignment
• Solving the Multi-Mode Resource-Constrained Project Scheduling Problem with genetic algorithms
• Depth-First Search and Linear Graph Algorithms
• Resource-constrained project scheduling: A heuristic for the multi-mode case
• Project scheduling with time windows and scarce resources. Temporal and resource-constrained project scheduling with regular and nonregular objective functions
• A competitive heuristic solution technique for resource-constrained project scheduling
• Project scheduling with multiple modes: A genetic algorithm
• A constraint-based method for project scheduling with time windows

This page was built for publication: A double genetic algorithm for the MRCPSP/max