Loading...
Please wait, while we are loading the content...
Similar Documents
Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays
| Content Provider | Semantic Scholar |
|---|---|
| Author | Abasian, Foroogh Ranjbar, Mohammad Salari, Majid Davari, Morteza Khatami, Seyed Morteza |
| Copyright Year | 2014 |
| 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. |
| Starting Page | 3975 |
| Ending Page | 3986 |
| Page Count | 12 |
| File Format | PDF HTM / HTML |
| DOI | 10.1016/j.apm.2014.01.006 |
| Volume Number | 38 |
| Alternate Webpage(s) | https://profdoc.um.ac.ir/articles/a/1042789.pdf |
| Alternate Webpage(s) | https://doi.org/10.1016/j.apm.2014.01.006 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
