By Topic

A MILP Approach to Schedule Parallel Independent Tasks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Alfredo Goldman ; DCC - IME - USP, Sao Paulo, Brazil ; Yanik Ngoko

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.

Published in:

2008 International Symposium on Parallel and Distributed Computing

Date of Conference:

1-5 July 2008