Lars Eufinger

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
Scheduling of jobs in parallel computing is crucial to efficiently use shared resources, while attaining user satisfaction. In this paper, we evaluate how mixed-integer linear programming (MILP) can be applied for the online parallel job scheduling problem (which is well-known to be an NP-complete problem). Therefore, we introduce the idea of planning(More)
We investigate a robust approach for solving the capacitated vehicle routing problem (CVRP) with uncertain travel times. It is based on the concept of K-adaptability, which allows to calculate a set of k feasible solutions in a preprocessing phase. Once a scenario occurs, the corresponding best solution may be picked out of the set of candidates. The aim is(More)
  • 1