A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems
By Bassem Jarboui, N. Damak, Patrick Siarry, Ahmed Riadh Rebai. Applied Mathematics and Computation, 2008
332 citations recorded by the source corpus.
Subfields: Industrial and Manufacturing Engineering, Management Science and Operations Research
View Paper: https://www.semanticscholar.org/paper/9c466bd0e9b3e8bccdfe079e4c0cebf6dc85f014
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Industrial and Manufacturing Engineering
In Management Science and Operations Research
Citations in the corpus
- A survey of variants and extensions of the resource-constrained project scheduling problem (2010, background): “Between two sub-activities i and i+1 a precedence relation is introduced as well as a maximal time lag to avoid preemption of the original activity.”
- A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem (2010, methodology): “Zhang et al. (2006) and Jarboui et al. (2008) presented the methodology of particle swarm optimization for solving the MRCPSP. Ranjbar et al. (2008) used a hybrid scatter-search to tackle the MRCPSP, using the path relinking methodology as a solution combination method.”