Tri-directional scheduling scheme: theory and computation
From MaRDI portal
Publication:655202
DOI10.1007/s10852-010-9132-2zbMath1229.90066OpenAlexW1973900595MaRDI QIDQ655202
H. R. Yoosefzadeh, Hamed Reza Tareghian, Mohammad Hadi Farahi
Publication date: 2 January 2012
Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10852-010-9132-2
Related Items (1)
Uses Software
Cites Work
- Experimental investigation of heuristics for resource-constrained project scheduling: an update
- Scheduling subject to resource constraints: Classification and complexity
- Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation
- A tabu search approach for the resource constrained project scheduling problem
- A branch and bound algorithm for the resource-constrained project scheduling problem
- A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version.
- Justification and RCPSP: a technique that pays
- Scheduling of resource-constrained projects
- Bidirectional planning: Improving priority rule-based heuristics for scheduling resource-constrained projects
- Solving the resource constrained project scheduling problem with optimization subroutine library
- A simulated annealing algorithm for resource constrained project scheduling problems
- A self-adapting genetic algorithm for project scheduling under resource constraints
- Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case
- A high-performance exact method for the resource-constrained project scheduling problem
This page was built for publication: Tri-directional scheduling scheme: theory and computation
