Mode-based versus activity-based search for a nonredundant resolution of the multimode resource-constrained project scheduling problem

DOI10.1155/2017/4627856zbMath1426.90130OpenAlexW2761891938MaRDI QIDQ1992769

Miguel A. Salido, Federico Barber, Daniel Morillo

Publication date: 5 November 2018

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2017/4627856

Mathematics Subject Classification ID

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

Related Items (2)

PSPLIB-ENERGY ⋮ An innovative four-layer heuristic for scheduling multi-mode projects under multiple resource constrains

Uses Software

• PSPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Project scheduling with finite or infinite number of activity processing modes -- a survey
• Experimental investigation of heuristics for resource-constrained project scheduling: an update
• A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem
• A note on ``Hierarchical models for multi-project planning and scheduling
• PSPLIB -- a project scheduling problem library
• An exact algorithm for project scheduling with multiple modes
• A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version.
• Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
• An experimental investigation of metaheuristics for the multi-mode resource-constrained project scheduling problem on new dataset instances
• Hierarchical models for multi-project planning and scheduling
• A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems
• A hybrid scatter search/electromagnetism meta-heuristic for project scheduling
• A Branch-and-Cut Procedure for the Multimode Resource-Constrained Project-Scheduling Problem
• Scheduling of Project Networks by Job Assignment
• A Decomposition-Based Genetic Algorithm for the Resource-Constrained Project-Scheduling Problem
• Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case
• A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
• Resource-constrained project scheduling by simulated annealing
• Solving the Multi-Mode Resource-Constrained Project Scheduling Problem with genetic algorithms
• Operational methods for minimization of energy consumption of manufacturing equipment
• A competitive heuristic solution technique for resource-constrained project scheduling
• Project scheduling with multiple modes: A genetic algorithm
• Simulated annealing for multi-mode resource-constrained project scheduling

This page was built for publication: Mode-based versus activity-based search for a nonredundant resolution of the multimode resource-constrained project scheduling problem