A multi-threaded local search algorithm and computer implementation for the multi-mode, resource-constrained multi-project scheduling problem. The article describes a solution approach for the multi-mode, resource-constrained multi-project scheduling problem. Our key ideas are based on the concepts of variable neighborhood search, together with iterated local search. A particular focus of this work is devoted towards the parallel implementation of such local search solution techniques. With the increasing availability of parallel (multi-core) computer hardware, we believe that such techniques are about to gain attractiveness in the future. Experiments have been conducted on benchmark instances of the MISTA 2013 Challenge, as well as on the well-known -datasets. The approach described in this article ranked second in the Challenge, and found new best results to 1371 of the 4320-instances. Note that the source-code of our implementation has been made available under url{doi:10.17632/cw95t56hjv.1}. The software may be freely used for non-profit (research/education) purposes.