A MILP Approach to Schedule Parallel Independent Tasks

摘要

We propose a new Mixed Integer Linear Programmingapproach to solve the classical problem of scheduling independent parallel tasks without preemption. We proposea formulation where the goal is to minimize the makespan.Then we show the flexibility of this approach by extendingthe result to the contiguous case. We validate this approachwith some experiments on the execution times and comparingthe optimal results with the solutions provided by listalgorithms.