Skip to Main Content
We propose a new mixed integer linear programming approach to solve the classical problem of scheduling independent parallel tasks without preemption. We propose a formulation where the goal is to minimize the makespan.Then we show the flexibility of this approach by extending the result to the contiguous case. We validate this approach with some experiments on the execution times and comparing the optimal results with the solutions provided by list algorithms.
Date of Conference: 1-5 July 2008