Title : ( Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays )
Authors: Foroogh Abasian , Mohammad Ranjbar , Majid Salari , Morteza Davari , Seyedmorteza Khatami ,
Full TextAbstract
This paper addresses a certain type of scheduling problem that arises when a parallel computation is to be executed on a set of identical parallel processors. It is assumed that if two precedence-related tasks are processed on two different processors, due to the information transferring, there will be a task-dependent communication delay between them. For each task, a processing time, a due date and a weight is given while the goal is to minimize the total weighted late work. An integer linear mathematical programming model and a branch-and-bound algorithm have been developed for the proposed problem. Comparing the results obtained by the proposed branch-and-bound algorithm with those obtained by CPLEX, indicates the effectiveness of the method.
Keywords
, Scheduling, Parallel processors, Communication delay, Branch-and-bound algorithm
@article{paperid:1042789,
author = {Abasian, Foroogh and Ranjbar, Mohammad and Salari, Majid and Morteza Davari and Khatami, Seyedmorteza},
title = {Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays},
journal = {Applied Mathematical Modelling},
year = {2014},
volume = {38},
number = {15},
month = {August},
issn = {0307-904X},
pages = {3975--3986},
numpages = {11},
keywords = {Scheduling، Parallel processors، Communication delay، Branch-and-bound algorithm},
}
%0 Journal Article
%T Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays
%A Abasian, Foroogh
%A Ranjbar, Mohammad
%A Salari, Majid
%A Morteza Davari
%A Khatami, Seyedmorteza
%J Applied Mathematical Modelling
%@ 0307-904X
%D 2014
