Multi‐mode resource‐constrained project scheduling using modified variable neighborhood search heuristic
From MaRDI portal
Publication:6088236
DOI10.1111/itor.12644OpenAlexW2916070201MaRDI QIDQ6088236
Michael J. Ryan, Ripon K. Chakrabortty, Alireza Abbasi
Publication date: 16 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12644
Related Items (6)
Optimizing resource-constrained project scheduling problem considering the reliability function ⋮ A variable neighborhood search for flying sidekick traveling salesman problem ⋮ The contractor time–cost–credit trade‐off problem: integer programming model, heuristic solution, and business insights ⋮ A two‐layer approach for solving robust decentralized multiproject scheduling problem with multi‐skilled staff ⋮ Considering project management activities for engineering design groups ⋮ An updated survey of variants and extensions of the resource-constrained project scheduling problem
Cites Work
- Unnamed Item
- On the efficient modeling and solution of the multi-mode resource-constrained project scheduling problem with generalized precedence relations
- An automatic algorithm selection approach for the multi-mode resource-constrained project scheduling problem
- The multi-mode resource-constrained multi-project scheduling problem, The MISTA 2013 challenge
- Multi-mode resource-constrained project scheduling problems with non-preemptive activity splitting
- Using resource scarceness characteristics to solve the multi-mode resource-constrained project scheduling problem
- Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers
- LSSPER: Solving the resource-constrained project scheduling problem with large neighbourhood search
- Experimental investigation of heuristics for resource-constrained project scheduling: an update
- Differential evolution for solving multi-mode resource-constrained project scheduling problems
- A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem
- Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation
- A new and efficient heuristic for scheduling projects with resource restrictions and multiple execution modes
- A genetic algorithm for multi-mode resource constrained project scheduling problem
- PSPLIB -- a project scheduling problem library
- Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm
- DSS for multiobjective project scheduling
- Variable neighborhood search
- A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version.
- Resource-constrained project scheduling: A survey of recent developments.
- Solving the resource-constrained project scheduling problem by a variable neighbourhood search.
- A path-relinking algorithm for the multi-mode resource-constrained project scheduling problem
- A general variable neighborhood search for the swap-body vehicle routing problem
- A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups
- A multi-threaded local search algorithm and computer implementation for the multi-mode, resource-constrained multi-project scheduling problem
- An experimental investigation of metaheuristics for the multi-mode resource-constrained project scheduling problem on new dataset instances
- A hybrid rank-based evolutionary algorithm applied to multi-mode resource-constrained project scheduling problem
- A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems
- A hybrid scatter search for the discrete time/resource trade-off problem in project scheduling
- Using a meta-heuristic algorithm for solving the multi-mode resource-constrained project scheduling problem
- Technical note: A single-pass heuristic for multi-mode single-resource constrained project scheduling
- A Branch-and-Cut Procedure for the Multimode Resource-Constrained Project-Scheduling Problem
- A lexicographic approach to the robust resource-constrained project scheduling problem
- Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case
- Project scheduling with multiple modes: A comparison of exact algorithms
- An evolutionary implicit enumeration procedure for solving the resource‐constrained project scheduling problem
- Extending time‐to‐target plots to multiple instances
- Solving the Multi-Mode Resource-Constrained Project Scheduling Problem with genetic algorithms
- Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
- An efficient General Variable Neighborhood Search for large Travelling Salesman Problem with Time Windows
- A generalized Kruskal-Wallis test for comparing K samples subject to unequal patterns of censorship
- Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
- Project scheduling with multiple modes: A genetic algorithm
- Simulated annealing for multi-mode resource-constrained project scheduling
- Analysis of scheduling schemes and heuristic rules performance in resource-constrained multiproject scheduling
- Benchmarking optimization software with performance profiles.
- Hybrid particle swarm and differential evolution algorithm for solving multimode resource-constrained project scheduling problem
- Modeling frameworks for the multi‐skill resource‐constrained project scheduling problem: a theoretical and empirical comparison
- A variable neighborhood search simheuristic for the multiperiod inventory routing problem with stochastic demands
This page was built for publication: Multi‐mode resource‐constrained project scheduling using modified variable neighborhood search heuristic
