Satisfiability modulo theory (SMT) formulation for optimal scheduling of task graphs with communication delay
| Year of publication: |
January 2018
|
|---|---|
| Authors: | Malik, Avinash ; Walker, Cameron ; O'Sullivan, Michael ; Sinnen, Oliver |
| Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 89.2018, p. 113-126
|
| Subject: | Parallel computing | Task scheduling with communication delays | SMT | MILP | Scheduling-Verfahren | Scheduling problem | Kommunikation | Communication | Graphentheorie | Graph theory | Parallelrechner | Parallel computer |
-
Scheduling multiple divisible loads in homogeneous star systems
Drozdowski, Maciej, (2008)
-
Dolgui, Alexandre, (2008)
-
Minimizing the stretch when scheduling flows of divisible requests
Legrand, Arnaud, (2008)
- More ...
-
A machine learning-based branch and price algorithm for a sampled vehicle routing problem
Furian, Nikolaus, (2021)
-
On Metrics for Supply Chain Resilience
Behzadi, Golnar, (2021)
-
Agribusiness Supply Chain Risk Management : A Review of Quantitative Decision Models
Behzadi, Golnar, (2021)
- More ...