# Exact and heuristic methods for the discrete parallel machine scheduling location problem

9 Jun 2020Raphael KramerArthur Kramer

The discrete parallel machine makespan scheduling location (ScheLoc) problem is an integrated combinatorial optimization problem that combines facility location and job scheduling. The problem consists in choosing the locations of $p$ machines among a finite set of candidates and scheduling a set of jobs on these machines, aiming to minimize the makespan... (read more)

PDF Abstract

No code implementations yet. Submit your code now