ITEM METADATA RECORD
Title: Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays
Authors: Abasian, Foroogh ×
Ranjbar, Mohammad
Salari, Majid
Davari, Morteza
Khatami, Seyed Morteza #
Issue Date: 2014
Publisher: Elsevier
Series Title: Applied Mathematical Modelling vol:38 issue:15-16 pages:3975-3986
Abstract: 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.
ISSN: 0307-904X
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Research Center for Operations Management, Leuven
× corresponding author
# (joint) last author

Files in This Item:
File Description Status SizeFormat
1-s2 0-S0307904X14000316-main.pdfMinimizing the total weighted late work in scheduling of identical parallel processors with communication delays Published 589KbAdobe PDFView/Open Request a copy

These files are only available to some KU Leuven Association staff members

 




All items in Lirias are protected by copyright, with all rights reserved.

© Web of science