Integrated Scheduling-Location Problems
Integrated Scheduling-Location (ScheLoc) Problems combine the decision of locating machines with the decision of scheduling jobs on the machines. Jobs are stored in job locations and for processing have to be taken to a machine location. This gives rise to location-dependent release dates such that in order to solve the problem to optimality, a machine location and an optimal schedule have to be chosen simultaneously.
We focus on the Single Machine Universal Network (SMUN) ScheLoc Problem. In this problem the jobs are located in the nodes of the network and travel times are given by shortest paths. We want to find a single machine location anywhere in the network such that a universal scheduling objective function is minimized. We show that for the special case with preemption and release dates the universal scheduling problem is polynomially solvable and use this result to propose a polynomial time algorithm for the corresponding ScheLoc Problem.
- Registration to Remy Spliet, email@example.com is required for availability of lunch.