@@ -22,11 +22,15 @@ Their algorithm is used for example by \citet{MyszkowskiLNS2018}.
We chose not to use their algorithm, because it depends on non-dominated sorting, which Deb himself describes as ineffective for more than a handful of objectives.
Our problem instances produce dozens of objectives, so we opted for a genetic algorithm that sorts solutions based the weighted product instead.
In his Ph.D. thesis, \citet{MontoyaCasas2012} focuses on exact methods for solving the MSRCPSP for medium-sized instances.
They model the MSRCPSP in five different ways using mixed integer linear programming.
They use a technique called \emph{column generation} to estimate lower bounds and solve instances, both exact and heuristically.
Finally, they use \emph{recovering beam search} to solve large instances.
\begin{itemize}[noitemsep]
\item Bellenguez-Morineau and Neron
\item Artigues Book
\item Almeida, Correia, Da-Gama
\item Montoya PhD thesis
\item Anabela Tereso, Monica Santos On The Multi-Mode, Multi-Skill Resource Constrained Project Scheduling Problem – A Software Application
\item Francisco Saldanha-da-Gama, Isabel Correia, Bernardo Almeida, Project scheduling with flexible resources: formulation and inequalities
