Heuristic and metaheuristic methods for the multi‐skill project scheduling problem with partial preemption
From MaRDI portal
Publication:6056166
DOI10.1111/itor.13063MaRDI QIDQ6056166
No author found.
Publication date: 29 September 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Related Items (2)
A two‐layer approach for solving robust decentralized multiproject scheduling problem with multi‐skilled staff ⋮ An enhanced GRASP approach for the index tracking problem
Cites Work
- Project scheduling with flexible resources: formulation and inequalities
- Branch-and-price approach for the multi-skill project scheduling problem
- LSSPER: Solving the resource-constrained project scheduling problem with large neighbourhood search
- Looking ahead with the pilot method
- Methods to solve multi-skill project scheduling problem
- Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation
- A biased random-key genetic algorithm for the project scheduling problem with flexible resources
- Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm
- An efficient metaheuristic for integrated scheduling and staffing IT projects based on a generalized minimum cost flow network
- An annotated bibliography of GRASP-Part II: Applications
- A Branch-and-Bound method for solving Multi-Skill Project Scheduling Problem
- An annotated bibliography of GRASP – Part I: Algorithms
- A Survey of Scheduling Rules
- Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
- Parallel Metaheuristics
- A NEW MEASURE OF RANK CORRELATION
- Modeling frameworks for the multi‐skill resource‐constrained project scheduling problem: a theoretical and empirical comparison
This page was built for publication: Heuristic and metaheuristic methods for the multi‐skill project scheduling problem with partial preemption
