Variable neighborhood search-based subproblem solution procedures for a parallel shifting bottleneck heuristic for complex job shops. - Andrew Bilyk; Lars Mönch (CASE, 2012)

A variable neighborhood search approach for planning and scheduling of jobs on unrelated parallel machines. - Andrew Bilyk; Lars Mönch (J. Intell. Manuf., 2012)

Scheduling jobs with ready times and precedence constraints on parallel batch machines using metaheuristics. - Andrew Bilyk; Lars Mönch; Christian Almeder (Comput. Ind. Eng., 2014)